Base | Representation |
---|---|
bin | 10111001100011100100110… |
… | …100000001110000010111111 |
3 | 111101012002201011100221212212 |
4 | 113030130212200032002333 |
5 | 101332314312020241042 |
6 | 1000542534244451035 |
7 | 30326003106132122 |
oct | 2714344640160277 |
9 | 441162634327785 |
10 | 102010414227647 |
11 | 2a55a412475372 |
12 | b5363753a9a7b |
13 | 44bc70514aca3 |
14 | 1b2948a8503b9 |
15 | bbd7d1bce482 |
hex | 5cc72680e0bf |
102010414227647 has 2 divisors, whose sum is σ = 102010414227648. Its totient is φ = 102010414227646.
The previous prime is 102010414227637. The next prime is 102010414227677. The reversal of 102010414227647 is 746722414010201.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 102010414227647 - 214 = 102010414211263 is a prime.
It is a super-2 number, since 2×1020104142276472 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (102010414227607) 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, 51005207113823 + 51005207113824.
It is an arithmetic number, because the mean of its divisors is an integer number (51005207113824).
Almost surely, 2102010414227647 is an apocalyptic number.
102010414227647 is a deficient number, since it is larger than the sum of its proper divisors (1).
102010414227647 is an equidigital number, since it uses as much as digits as its factorization.
102010414227647 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 150528, while the sum is 41.
Adding to 102010414227647 its reverse (746722414010201), we get a palindrome (848732828237848).
The spelling of 102010414227647 in words is "one hundred two trillion, ten billion, four hundred fourteen million, two hundred twenty-seven thousand, six hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •