Base | Representation |
---|---|
bin | 1101110001110… |
… | …10110000000001 |
3 | 22001111021102221 |
4 | 12320322300001 |
5 | 214042142001 |
6 | 15245211041 |
7 | 2602306411 |
oct | 670726001 |
9 | 261437387 |
10 | 115584001 |
11 | 5a275a75 |
12 | 32860a81 |
13 | 1ac3bc00 |
14 | 114ca641 |
15 | a2321a1 |
hex | 6e3ac01 |
115584001 has 9 divisors (see below), whose sum is σ = 125310531. Its totient is φ = 106563912.
The previous prime is 115583989. The next prime is 115584017. The reversal of 115584001 is 100485511.
It is a happy number.
The square root of 115584001 is 10751.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 17098225 + 98485776 = 4135^2 + 9924^2 .
It is not a de Polignac number, because 115584001 - 211 = 115581953 is a prime.
It is a super-2 number, since 2×1155840012 = 26719322574336002, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (115584061) by changing a digit.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 139350 + ... + 140176.
Almost surely, 2115584001 is an apocalyptic number.
115584001 is the 10751-st square number.
115584001 is the 5376-th centered octagonal number.
It is an amenable number.
115584001 is a deficient number, since it is larger than the sum of its proper divisors (9726530).
115584001 is an frugal number, since it uses more digits than its factorization.
115584001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1680 (or 840 counting only the distinct ones).
The product of its (nonzero) digits is 800, while the sum is 25.
The cubic root of 115584001 is about 487.1162016267.
Multiplying 115584001 by its sum of digits (25), we get a square (2889600025 = 537552).
The spelling of 115584001 in words is "one hundred fifteen million, five hundred eighty-four thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •