Base | Representation |
---|---|
bin | 1001101001101100110101… |
… | …1101011001100001001011 |
3 | 1101120111110122210102012211 |
4 | 2122123031131121201023 |
5 | 2342331402130211344 |
6 | 34323032025245551 |
7 | 2143456440605665 |
oct | 232331535314113 |
9 | 41514418712184 |
10 | 10612016257099 |
11 | 3421592582404 |
12 | 123481a9338b7 |
13 | 5bc92a42011a |
14 | 2898a5223535 |
15 | 136099b93334 |
hex | 9a6cd75984b |
10612016257099 has 2 divisors, whose sum is σ = 10612016257100. Its totient is φ = 10612016257098.
The previous prime is 10612016257097. The next prime is 10612016257147. The reversal of 10612016257099 is 99075261021601.
It is a happy number.
It is a weak prime.
It is an emirp because it is prime and its reverse (99075261021601) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10612016257099 - 21 = 10612016257097 is a prime.
It is a super-2 number, since 2×106120162570992 (a number of 27 digits) contains 22 as substring.
Together with 10612016257097, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (10612016257097) 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, 5306008128549 + 5306008128550.
It is an arithmetic number, because the mean of its divisors is an integer number (5306008128550).
Almost surely, 210612016257099 is an apocalyptic number.
10612016257099 is a deficient number, since it is larger than the sum of its proper divisors (1).
10612016257099 is an equidigital number, since it uses as much as digits as its factorization.
10612016257099 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 408240, while the sum is 49.
The spelling of 10612016257099 in words is "ten trillion, six hundred twelve billion, sixteen million, two hundred fifty-seven thousand, ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •