Base | Representation |
---|---|
bin | 10001100110111001110… |
… | …000001000010100000101 |
3 | 11021200020010122010112111 |
4 | 101212321300020110011 |
5 | 124311041031241401 |
6 | 2323511202421021 |
7 | 153263661050164 |
oct | 21467160102405 |
9 | 4250203563474 |
10 | 1210002212101 |
11 | 427182782091 |
12 | 17660b361771 |
13 | 8a14489acc7 |
14 | 427c8aa53db |
15 | 2171cd83e51 |
hex | 119b9c08505 |
1210002212101 has 8 divisors (see below), whose sum is σ = 1236364932600. Its totient is φ = 1183770324672.
The previous prime is 1210002212077. The next prime is 1210002212131. The reversal of 1210002212101 is 1012122000121.
It can be written as a sum of positive squares in 4 ways, for example, as 250335112225 + 959667099876 = 500335^2 + 979626^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 1210002212101 - 221 = 1210000114949 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 (1210002212131) 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, 32689570 + ... + 32726563.
It is an arithmetic number, because the mean of its divisors is an integer number (154545616575).
Almost surely, 21210002212101 is an apocalyptic number.
It is an amenable number.
1210002212101 is a deficient number, since it is larger than the sum of its proper divisors (26362720499).
1210002212101 is an equidigital number, since it uses as much as digits as its factorization.
1210002212101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 65416535.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 1210002212101 its reverse (1012122000121), we get a palindrome (2222124212222).
The spelling of 1210002212101 in words is "one trillion, two hundred ten billion, two million, two hundred twelve thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •