Base | Representation |
---|---|
bin | 11010010000010000101100… |
… | …001011100100001101001110 |
3 | 120010211111120210221102000212 |
4 | 122100100230023210031032 |
5 | 110113301140323440204 |
6 | 1045324350522122422 |
7 | 33215122013125061 |
oct | 3220205413441516 |
9 | 503744523842025 |
10 | 115466642015054 |
11 | 33878145232350 |
12 | 10b4a260950412 |
13 | 4c575c4516355 |
14 | 20728885108d8 |
15 | d53844234c6e |
hex | 69042c2e434e |
115466642015054 has 8 divisors (see below), whose sum is σ = 188945414206488. Its totient is φ = 52484837279560.
The previous prime is 115466642015051. The next prime is 115466642015273. The reversal of 115466642015054 is 450510246664511.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a junction number, because it is equal to n+sod(n) for n = 115466642014993 and 115466642015011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (115466642015051) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2624241863957 + ... + 2624241864000.
It is an arithmetic number, because the mean of its divisors is an integer number (23618176775811).
Almost surely, 2115466642015054 is an apocalyptic number.
115466642015054 is a deficient number, since it is larger than the sum of its proper divisors (73478772191434).
115466642015054 is a wasteful number, since it uses less digits than its factorization.
115466642015054 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5248483727970.
The product of its (nonzero) digits is 3456000, while the sum is 50.
Adding to 115466642015054 its reverse (450510246664511), we get a palindrome (565976888679565).
The spelling of 115466642015054 in words is "one hundred fifteen trillion, four hundred sixty-six billion, six hundred forty-two million, fifteen thousand, fifty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •