Base | Representation |
---|---|
bin | 110101101000001110… |
… | …0000100100101110000 |
3 | 102000021010110120120120 |
4 | 1223100130010211300 |
5 | 3341330014410311 |
6 | 124523454410240 |
7 | 11214632200662 |
oct | 1532034044560 |
9 | 360233416516 |
10 | 115166169456 |
11 | 44929333748 |
12 | 1a3a0b00980 |
13 | ab248c9400 |
14 | 580737c532 |
15 | 2ee0924706 |
hex | 1ad0704970 |
115166169456 has 240 divisors, whose sum is σ = 327540866400. Its totient is φ = 34848473088.
The previous prime is 115166169421. The next prime is 115166169463. The reversal of 115166169456 is 654961661511.
It is a junction number, because it is equal to n+sod(n) for n = 115166169399 and 115166169408.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 194209096 + ... + 194209688.
It is an arithmetic number, because the mean of its divisors is an integer number (1364753610).
Almost surely, 2115166169456 is an apocalyptic number.
115166169456 is a gapful number since it is divisible by the number (16) 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 115166169456, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (163770433200).
115166169456 is an abundant number, since it is smaller than the sum of its proper divisors (212374696944).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
115166169456 is a wasteful number, since it uses less digits than its factorization.
115166169456 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 988 (or 969 counting only the distinct ones).
The product of its digits is 1166400, while the sum is 51.
The spelling of 115166169456 in words is "one hundred fifteen billion, one hundred sixty-six million, one hundred sixty-nine thousand, four hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •