Base | Representation |
---|---|
bin | 101101101101001110100100… |
… | …010100100100111001110011 |
3 | 222100202100001011211220200121 |
4 | 231231032210110210321303 |
5 | 202322003141432242042 |
6 | 1551311210401031111 |
7 | 60225136515461233 |
oct | 5555164424447163 |
9 | 870670034756617 |
10 | 201020111212147 |
11 | 59062172217627 |
12 | 1a667064625497 |
13 | 8822165ca0346 |
14 | 378d5d5021cc3 |
15 | 1838edb1dd367 |
hex | b6d3a4524e73 |
201020111212147 has 2 divisors, whose sum is σ = 201020111212148. Its totient is φ = 201020111212146.
The previous prime is 201020111212087. The next prime is 201020111212343. The reversal of 201020111212147 is 741212111020102.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 201020111212147 - 215 = 201020111179379 is a prime.
It is a super-2 number, since 2×2010201112121472 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (201020111216147) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100510055606073 + 100510055606074.
It is an arithmetic number, because the mean of its divisors is an integer number (100510055606074).
Almost surely, 2201020111212147 is an apocalyptic number.
201020111212147 is a deficient number, since it is larger than the sum of its proper divisors (1).
201020111212147 is an equidigital number, since it uses as much as digits as its factorization.
201020111212147 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 448, while the sum is 25.
Adding to 201020111212147 its reverse (741212111020102), we get a palindrome (942232222232249).
The spelling of 201020111212147 in words is "two hundred one trillion, twenty billion, one hundred eleven million, two hundred twelve thousand, one hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •