Base | Representation |
---|---|
bin | 10010111010100101… |
… | …010001001101111011 |
3 | 1221102110020010022111 |
4 | 102322211101031323 |
5 | 313043402414321 |
6 | 13155210033151 |
7 | 1316206601416 |
oct | 227245211573 |
9 | 57373203274 |
10 | 20310201211 |
11 | 8682640863 |
12 | 3b29a187b7 |
13 | 1bb8a37a51 |
14 | da9592b7d |
15 | 7dd0e25e1 |
hex | 4ba95137b |
20310201211 has 8 divisors (see below), whose sum is σ = 21086561664. Its totient is φ = 19541415360.
The previous prime is 20310201187. The next prime is 20310201217. The reversal of 20310201211 is 11210201302.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 20310201211 - 211 = 20310199163 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 20310201191 and 20310201200.
It is not an unprimeable number, because it can be changed into a prime (20310201217) 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 in 7 ways as a sum of consecutive naturals, for example, 1888186 + ... + 1898911.
It is an arithmetic number, because the mean of its divisors is an integer number (2635820208).
Almost surely, 220310201211 is an apocalyptic number.
20310201211 is a deficient number, since it is larger than the sum of its proper divisors (776360453).
20310201211 is a wasteful number, since it uses less digits than its factorization.
20310201211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3787301.
The product of its (nonzero) digits is 24, while the sum is 13.
Adding to 20310201211 its reverse (11210201302), we get a palindrome (31520402513).
Subtracting from 20310201211 its reverse (11210201302), we obtain a palindrome (9099999909).
The spelling of 20310201211 in words is "twenty billion, three hundred ten million, two hundred one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.130 sec. • engine limits •