Base | Representation |
---|---|
bin | 1001101001100101100011… |
… | …1010111000010010111011 |
3 | 1101120022102101201122202121 |
4 | 2122121120322320102323 |
5 | 2342313401112113232 |
6 | 34322110022342111 |
7 | 2143360126616602 |
oct | 232313072702273 |
9 | 41508371648677 |
10 | 10610061051067 |
11 | 3420779950155 |
12 | 1234373b8a937 |
13 | 5bc6a832a68a |
14 | 28975b6a8a39 |
15 | 135ed31ccd97 |
hex | 9a658eb84bb |
10610061051067 has 2 divisors, whose sum is σ = 10610061051068. Its totient is φ = 10610061051066.
The previous prime is 10610061051053. The next prime is 10610061051127. The reversal of 10610061051067 is 76015016001601.
It is a weak prime.
It is an emirp because it is prime and its reverse (76015016001601) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10610061051067 - 211 = 10610061049019 is a prime.
It is a super-2 number, since 2×106100610510672 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (10610061052067) 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, 5305030525533 + 5305030525534.
It is an arithmetic number, because the mean of its divisors is an integer number (5305030525534).
Almost surely, 210610061051067 is an apocalyptic number.
10610061051067 is a deficient number, since it is larger than the sum of its proper divisors (1).
10610061051067 is an equidigital number, since it uses as much as digits as its factorization.
10610061051067 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 7560, while the sum is 34.
Adding to 10610061051067 its reverse (76015016001601), we get a palindrome (86625077052668).
The spelling of 10610061051067 in words is "ten trillion, six hundred ten billion, sixty-one million, fifty-one thousand, sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •