Base | Representation |
---|---|
bin | 1001000110000111001010… |
… | …00010010001111001001110 |
3 | 2121211002121201212122011021 |
4 | 10203003211002101321032 |
5 | 10110144434314411342 |
6 | 110312232411144354 |
7 | 4133016431341051 |
oct | 443034502217116 |
9 | 77732551778137 |
10 | 20001210310222 |
11 | 6411513876019 |
12 | 22b0450a450ba |
13 | b2114bc7802b |
14 | 4d20c6cb2a98 |
15 | 24a42625b567 |
hex | 1230e5091e4e |
20001210310222 has 8 divisors (see below), whose sum is σ = 30030092391672. Its totient is φ = 9991179513000.
The previous prime is 20001210310187. The next prime is 20001210310229. The reversal of 20001210310222 is 22201301210002.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a junction number, because it is equal to n+sod(n) for n = 20001210310196 and 20001210310205.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20001210310229) 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 3 ways as a sum of consecutive naturals, for example, 4712818404 + ... + 4712822647.
It is an arithmetic number, because the mean of its divisors is an integer number (3753761548959).
Almost surely, 220001210310222 is an apocalyptic number.
20001210310222 is a deficient number, since it is larger than the sum of its proper divisors (10028882081450).
20001210310222 is a wasteful number, since it uses less digits than its factorization.
20001210310222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9425642114.
The product of its (nonzero) digits is 96, while the sum is 16.
Adding to 20001210310222 its reverse (22201301210002), we get a palindrome (42202511520224).
The spelling of 20001210310222 in words is "twenty trillion, one billion, two hundred ten million, three hundred ten thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •