Base | Representation |
---|---|
bin | 100100001000001… |
… | …0000001011001001 |
3 | 10010111000011100221 |
4 | 1020100100023021 |
5 | 4440312020410 |
6 | 320142030041 |
7 | 42016462255 |
oct | 11020201311 |
9 | 3114004327 |
10 | 1212220105 |
11 | 5722a29a8 |
12 | 299b78321 |
13 | 1641b2705 |
14 | b6dd1265 |
15 | 716514da |
hex | 484102c9 |
1212220105 has 8 divisors (see below), whose sum is σ = 1540232712. Its totient is φ = 912730368.
The previous prime is 1212220091. The next prime is 1212220111. The reversal of 1212220105 is 5010222121.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 190522809 + 1021697296 = 13803^2 + 31964^2 .
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 1212220105 - 25 = 1212220073 is a prime.
It is a super-2 number, since 2×12122201052 = 2938955165932422050, which contains 22 as substring.
It is a Duffinian number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 7130622 + ... + 7130791.
It is an arithmetic number, because the mean of its divisors is an integer number (192529089).
Almost surely, 21212220105 is an apocalyptic number.
It is an amenable number.
1212220105 is a deficient number, since it is larger than the sum of its proper divisors (328012607).
1212220105 is a wasteful number, since it uses less digits than its factorization.
1212220105 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14261435.
The product of its (nonzero) digits is 80, while the sum is 16.
The square root of 1212220105 is about 34816.9514030163. The cubic root of 1212220105 is about 1066.2535600275.
Adding to 1212220105 its reverse (5010222121), we get a palindrome (6222442226).
The spelling of 1212220105 in words is "one billion, two hundred twelve million, two hundred twenty thousand, one hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •