Base | Representation |
---|---|
bin | 11010011110000001010100… |
… | …000010111110010100000111 |
3 | 120021011220020121222200111020 |
4 | 122132001110002332110013 |
5 | 110224244143114001310 |
6 | 1051331010021442223 |
7 | 33343334633352300 |
oct | 3236012402762407 |
9 | 507156217880436 |
10 | 116412203656455 |
11 | 34102158116733 |
12 | 1108156b570373 |
13 | 4cc581536b785 |
14 | 20a65489a57a7 |
15 | d6d236642170 |
hex | 69e0540be507 |
116412203656455 has 48 divisors (see below), whose sum is σ = 218586671453664. Its totient is φ = 52746060380160.
The previous prime is 116412203656451. The next prime is 116412203656499. The reversal of 116412203656455 is 554656302214611.
It is not a de Polignac number, because 116412203656455 - 22 = 116412203656451 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 116412203656398 and 116412203656407.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (116412203656451) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 700730886 + ... + 700896995.
It is an arithmetic number, because the mean of its divisors is an integer number (4553888988618).
Almost surely, 2116412203656455 is an apocalyptic number.
116412203656455 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
116412203656455 is a deficient number, since it is larger than the sum of its proper divisors (102174467797209).
116412203656455 is a wasteful number, since it uses less digits than its factorization.
116412203656455 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1401628016 (or 1401628009 counting only the distinct ones).
The product of its (nonzero) digits is 5184000, while the sum is 51.
The spelling of 116412203656455 in words is "one hundred sixteen trillion, four hundred twelve billion, two hundred three million, six hundred fifty-six thousand, four hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •