Base | Representation |
---|---|
bin | 1001000110011011011110… |
… | …10011111010010111011111 |
3 | 2121212010210001121112120112 |
4 | 10203031233103322113133 |
5 | 10110334310222412342 |
6 | 110321235134240235 |
7 | 4133553664250666 |
oct | 443155723722737 |
9 | 77763701545515 |
10 | 20012120122847 |
11 | 6416102104796 |
12 | 22b259665607b |
13 | b2219a2b6368 |
14 | 4d283dbc7ddd |
15 | 24a863e33682 |
hex | 12336f4fa5df |
20012120122847 has 2 divisors, whose sum is σ = 20012120122848. Its totient is φ = 20012120122846.
The previous prime is 20012120122783. The next prime is 20012120122879. The reversal of 20012120122847 is 74822102121002.
It is an a-pointer prime, because the next prime (20012120122879) can be obtained adding 20012120122847 to its sum of digits (32).
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 20012120122847 - 26 = 20012120122783 is a prime.
It is a super-2 number, since 2×200121201228472 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20012120122447) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10006060061423 + 10006060061424.
It is an arithmetic number, because the mean of its divisors is an integer number (10006060061424).
Almost surely, 220012120122847 is an apocalyptic number.
20012120122847 is a deficient number, since it is larger than the sum of its proper divisors (1).
20012120122847 is an equidigital number, since it uses as much as digits as its factorization.
20012120122847 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 7168, while the sum is 32.
Adding to 20012120122847 its reverse (74822102121002), we get a palindrome (94834222243849).
The spelling of 20012120122847 in words is "twenty trillion, twelve billion, one hundred twenty million, one hundred twenty-two thousand, eight hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.103 sec. • engine limits •