Base | Representation |
---|---|
bin | 1001000110000111001000… |
… | …11111100100001011110101 |
3 | 2121211002121002202022010202 |
4 | 10203003210133210023311 |
5 | 10110144430002210401 |
6 | 110312231444130245 |
7 | 4133016261110066 |
oct | 443034437441365 |
9 | 77732532668122 |
10 | 20001201210101 |
11 | 641150971aa61 |
12 | 22b0449996985 |
13 | b2114a10cc47 |
14 | 4d20c59c456d |
15 | 24a42556006b |
hex | 1230e47e42f5 |
20001201210101 has 8 divisors (see below), whose sum is σ = 21178010752920. Its totient is φ = 18824421477888.
The previous prime is 20001201210097. The next prime is 20001201210131. The reversal of 20001201210101 is 10101210210002.
It can be written as a sum of positive squares in 4 ways, for example, as 8635193644900 + 11366007565201 = 2938570^2 + 3371351^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 20001201210101 - 22 = 20001201210097 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20001201210131) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 6063896 + ... + 8762033.
It is an arithmetic number, because the mean of its divisors is an integer number (2647251344115).
Almost surely, 220001201210101 is an apocalyptic number.
It is an amenable number.
20001201210101 is a deficient number, since it is larger than the sum of its proper divisors (1176809542819).
20001201210101 is a wasteful number, since it uses less digits than its factorization.
20001201210101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 14905303.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 20001201210101 its reverse (10101210210002), we get a palindrome (30102411420103).
The spelling of 20001201210101 in words is "twenty trillion, one billion, two hundred one million, two hundred ten thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.342 sec. • engine limits •