Base | Representation |
---|---|
bin | 100100000100010… |
… | …0111111001000101 |
3 | 10010100020112212201 |
4 | 1020020213321011 |
5 | 4434304020401 |
6 | 320031114501 |
7 | 41663462326 |
oct | 11010477105 |
9 | 3110215781 |
10 | 1210220101 |
11 | 571157302 |
12 | 299372a31 |
13 | 16396228c |
14 | b6a3044d |
15 | 713a8b01 |
hex | 48227e45 |
1210220101 has 8 divisors (see below), whose sum is σ = 1213636608. Its totient is φ = 1206810000.
The previous prime is 1210220059. The next prime is 1210220107. The reversal of 1210220101 is 1010220121.
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 1210220101 - 27 = 1210219973 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 (1210220107) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1050876 + ... + 1052026.
It is an arithmetic number, because the mean of its divisors is an integer number (151704576).
Almost surely, 21210220101 is an apocalyptic number.
It is an amenable number.
1210220101 is a deficient number, since it is larger than the sum of its proper divisors (3416507).
1210220101 is a wasteful number, since it uses less digits than its factorization.
1210220101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3203.
The product of its (nonzero) digits is 8, while the sum is 10.
The square root of 1210220101 is about 34788.2178474264. The cubic root of 1210220101 is about 1065.6668444521. Note that the first 3 decimals are identical.
Adding to 1210220101 its reverse (1010220121), we get a palindrome (2220440222).
The spelling of 1210220101 in words is "one billion, two hundred ten million, two hundred twenty thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •