Base | Representation |
---|---|
bin | 1001010001110010111000… |
… | …1100010100101001000011 |
3 | 1100010020101200200020221001 |
4 | 2110130232030110221003 |
5 | 2314114302002411321 |
6 | 33410231152512431 |
7 | 2102010163632154 |
oct | 224345614245103 |
9 | 40106350606831 |
10 | 10201322310211 |
11 | 32833a155047a |
12 | 118910224b717 |
13 | 58cc993c4476 |
14 | 273a64a9b92b |
15 | 12a55e512c91 |
hex | 9472e314a43 |
10201322310211 has 2 divisors, whose sum is σ = 10201322310212. Its totient is φ = 10201322310210.
The previous prime is 10201322310197. The next prime is 10201322310229. The reversal of 10201322310211 is 11201322310201.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 10201322310211 - 27 = 10201322310083 is a prime.
It is a super-2 number, since 2×102013223102112 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (10201322310271) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5100661155105 + 5100661155106.
It is an arithmetic number, because the mean of its divisors is an integer number (5100661155106).
Almost surely, 210201322310211 is an apocalyptic number.
10201322310211 is a deficient number, since it is larger than the sum of its proper divisors (1).
10201322310211 is an equidigital number, since it uses as much as digits as its factorization.
10201322310211 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 144, while the sum is 19.
Adding to 10201322310211 its reverse (11201322310201), we get a palindrome (21402644620412).
The spelling of 10201322310211 in words is "ten trillion, two hundred one billion, three hundred twenty-two million, three hundred ten thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •