Base | Representation |
---|---|
bin | 110001100011010010… |
… | …0011010111110011111 |
3 | 101011122221102011221122 |
4 | 1203012210122332133 |
5 | 3220412111322201 |
6 | 120515005321155 |
7 | 10454645420501 |
oct | 1430644327637 |
9 | 334587364848 |
10 | 106410651551 |
11 | 41146047536 |
12 | 187588661bb |
13 | a05a9a9099 |
14 | 5216607d71 |
15 | 2b7be3be1b |
hex | 18c691af9f |
106410651551 has 2 divisors, whose sum is σ = 106410651552. Its totient is φ = 106410651550.
The previous prime is 106410651521. The next prime is 106410651559. The reversal of 106410651551 is 155156014601.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-106410651551 is a prime.
It is a super-2 number, since 2×1064106515512 (a number of 23 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (106410651559) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 53205325775 + 53205325776.
It is an arithmetic number, because the mean of its divisors is an integer number (53205325776).
Almost surely, 2106410651551 is an apocalyptic number.
106410651551 is a deficient number, since it is larger than the sum of its proper divisors (1).
106410651551 is an equidigital number, since it uses as much as digits as its factorization.
106410651551 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 18000, while the sum is 35.
The spelling of 106410651551 in words is "one hundred six billion, four hundred ten million, six hundred fifty-one thousand, five hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •