Base | Representation |
---|---|
bin | 1001000110000101010110… |
… | …0111010000101000110100 |
3 | 1022102000001120110001221211 |
4 | 2101201111213100220310 |
5 | 2302320221234021322 |
6 | 33133554121451204 |
7 | 2051325205243453 |
oct | 221412547205064 |
9 | 38360046401854 |
10 | 10000120220212 |
11 | 3206033186271 |
12 | 1156110040b04 |
13 | 57701302b745 |
14 | 2680190a4b9a |
15 | 1251d578db77 |
hex | 918559d0a34 |
10000120220212 has 12 divisors (see below), whose sum is σ = 17500680110340. Its totient is φ = 4999925902976.
The previous prime is 10000120220191. The next prime is 10000120220213. The reversal of 10000120220212 is 21202202100001.
It is a happy number.
It can be written as a sum of positive squares in 2 ways, for example, as 2119714693776 + 7880405526436 = 1455924^2 + 2807206^2 .
It is a junction number, because it is equal to n+sod(n) for n = 10000120220192 and 10000120220201.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10000120220213) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 33384037 + ... + 33682252.
It is an arithmetic number, because the mean of its divisors is an integer number (1458390009195).
Almost surely, 210000120220212 is an apocalyptic number.
It is an amenable number.
10000120220212 is a deficient number, since it is larger than the sum of its proper divisors (7500559890128).
10000120220212 is a wasteful number, since it uses less digits than its factorization.
10000120220212 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 67103570 (or 67103568 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 13.
Adding to 10000120220212 its reverse (21202202100001), we get a palindrome (31202322320213).
The spelling of 10000120220212 in words is "ten trillion, one hundred twenty million, two hundred twenty thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •