Base | Representation |
---|---|
bin | 1001100011100010101100… |
… | …1110100011001110110011 |
3 | 1101012101101012111220101012 |
4 | 2120320223032203032303 |
5 | 2334113212100200002 |
6 | 34202253314301135 |
7 | 2133022544034011 |
oct | 230705316431663 |
9 | 41171335456335 |
10 | 10506215240627 |
11 | 339072a674817 |
12 | 12182122877ab |
13 | 5b2968b34372 |
14 | 28470998d8b1 |
15 | 133456528d52 |
hex | 98e2b3a33b3 |
10506215240627 has 2 divisors, whose sum is σ = 10506215240628. Its totient is φ = 10506215240626.
The previous prime is 10506215240593. The next prime is 10506215240641. The reversal of 10506215240627 is 72604251260501.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 10506215240627 - 210 = 10506215239603 is a prime.
It is a super-2 number, since 2×105062152406272 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (10506215240327) by changing a digit.
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 as a sum of consecutive naturals, namely, 5253107620313 + 5253107620314.
It is an arithmetic number, because the mean of its divisors is an integer number (5253107620314).
Almost surely, 210506215240627 is an apocalyptic number.
10506215240627 is a deficient number, since it is larger than the sum of its proper divisors (1).
10506215240627 is an equidigital number, since it uses as much as digits as its factorization.
10506215240627 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 201600, while the sum is 41.
The spelling of 10506215240627 in words is "ten trillion, five hundred six billion, two hundred fifteen million, two hundred forty thousand, six hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.213 sec. • engine limits •