Base | Representation |
---|---|
bin | 11010100000110110011000… |
… | …011111101000111110110001 |
3 | 120021212111002020002012210210 |
4 | 122200312120133220332301 |
5 | 110240440332120102012 |
6 | 1052000202205414333 |
7 | 33363356612240103 |
oct | 3240663037507661 |
9 | 507774066065723 |
10 | 116606625550257 |
11 | 34177657216107 |
12 | 110b318ab6a3a9 |
13 | 500ac5ab2a89b |
14 | 20b1b0dcdb573 |
15 | d7331501923c |
hex | 6a0d987e8fb1 |
116606625550257 has 16 divisors (see below), whose sum is σ = 155666901619008. Its totient is φ = 77642067263040.
The previous prime is 116606625550241. The next prime is 116606625550273. The reversal of 116606625550257 is 752055526606611.
It is an interprime number because it is at equal distance from previous prime (116606625550241) and next prime (116606625550273).
It is not a de Polignac number, because 116606625550257 - 24 = 116606625550241 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 116606625550197 and 116606625550206.
It is not an unprimeable number, because it can be changed into a prime (116606625550057) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 24807643 + ... + 29131295.
It is an arithmetic number, because the mean of its divisors is an integer number (9729181351188).
Almost surely, 2116606625550257 is an apocalyptic number.
It is an amenable number.
116606625550257 is a deficient number, since it is larger than the sum of its proper divisors (39060276068751).
116606625550257 is a wasteful number, since it uses less digits than its factorization.
116606625550257 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4334720.
The product of its (nonzero) digits is 22680000, while the sum is 57.
The spelling of 116606625550257 in words is "one hundred sixteen trillion, six hundred six billion, six hundred twenty-five million, five hundred fifty thousand, two hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •