Base | Representation |
---|---|
bin | 110101101010110101… |
… | …1100101000110110100 |
3 | 102000111020221222020212 |
4 | 1223111223211012310 |
5 | 3342020023332014 |
6 | 124540315444552 |
7 | 11220050602100 |
oct | 1532553450664 |
9 | 360436858225 |
10 | 115254120884 |
11 | 44973a45981 |
12 | 1a406456758 |
13 | ab39bb1a86 |
14 | 5814d14900 |
15 | 2ee84e923e |
hex | 1ad5ae51b4 |
115254120884 has 72 divisors (see below), whose sum is σ = 238757258880. Its totient is φ = 48525665664.
The previous prime is 115254120851. The next prime is 115254120887. The reversal of 115254120884 is 488021452511.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (115254120887) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 28295072 + ... + 28299144.
It is an arithmetic number, because the mean of its divisors is an integer number (3316073040).
Almost surely, 2115254120884 is an apocalyptic number.
115254120884 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 115254120884, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (119378629440).
115254120884 is an abundant number, since it is smaller than the sum of its proper divisors (123503137996).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
115254120884 is a wasteful number, since it uses less digits than its factorization.
115254120884 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6597 (or 6588 counting only the distinct ones).
The product of its (nonzero) digits is 102400, while the sum is 41.
The spelling of 115254120884 in words is "one hundred fifteen billion, two hundred fifty-four million, one hundred twenty thousand, eight hundred eighty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •