Base | Representation |
---|---|
bin | 11010010000110001000101… |
… | …101101100111011101100100 |
3 | 120010221211101020212201221202 |
4 | 122100301011231213131210 |
5 | 110114333412102010202 |
6 | 1045352342515502032 |
7 | 33220463053061420 |
oct | 3220610555473544 |
9 | 503854336781852 |
10 | 115501430110052 |
11 | 338909771a9a88 |
12 | 10b54b4b2b7918 |
13 | 4c5a97987504c |
14 | 2074428819b80 |
15 | d546cd3a8802 |
hex | 690c45b67764 |
115501430110052 has 48 divisors (see below), whose sum is σ = 232218286153728. Its totient is φ = 49240177858080.
The previous prime is 115501430110037. The next prime is 115501430110097. The reversal of 115501430110052 is 250011034105511.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 115501430109997 and 115501430110024.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 224075123 + ... + 224589989.
It is an arithmetic number, because the mean of its divisors is an integer number (4837880961536).
Almost surely, 2115501430110052 is an apocalyptic number.
It is an amenable number.
115501430110052 is an abundant number, since it is smaller than the sum of its proper divisors (116716856043676).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
115501430110052 is a wasteful number, since it uses less digits than its factorization.
115501430110052 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 557016 (or 557014 counting only the distinct ones).
The product of its (nonzero) digits is 3000, while the sum is 29.
Adding to 115501430110052 its reverse (250011034105511), we get a palindrome (365512464215563).
The spelling of 115501430110052 in words is "one hundred fifteen trillion, five hundred one billion, four hundred thirty million, one hundred ten thousand, fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •