Base | Representation |
---|---|
bin | 10001100110111001101… |
… | …100010011111101000001 |
3 | 11021200020001202021120010 |
4 | 101212321230103331001 |
5 | 124311040302224301 |
6 | 2323511125135133 |
7 | 153263646411126 |
oct | 21467154237501 |
9 | 4250201667503 |
10 | 1210001211201 |
11 | 4271821590a2 |
12 | 17660ab5a4a9 |
13 | 8a14460a563 |
14 | 427c88c474d |
15 | 2171cc375d6 |
hex | 119b9b13f41 |
1210001211201 has 4 divisors (see below), whose sum is σ = 1613334948272. Its totient is φ = 806667474132.
The previous prime is 1210001211197. The next prime is 1210001211253. The reversal of 1210001211201 is 1021121000121.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 1210001211201 - 22 = 1210001211197 is a prime.
It is a super-2 number, since 2×12100012112012 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1210001218201) 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, 201666868531 + ... + 201666868536.
It is an arithmetic number, because the mean of its divisors is an integer number (403333737068).
Almost surely, 21210001211201 is an apocalyptic number.
It is an amenable number.
1210001211201 is a deficient number, since it is larger than the sum of its proper divisors (403333737071).
1210001211201 is an equidigital number, since it uses as much as digits as its factorization.
1210001211201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 403333737070.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 1210001211201 its reverse (1021121000121), we get a palindrome (2231122211322).
The spelling of 1210001211201 in words is "one trillion, two hundred ten billion, one million, two hundred eleven thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •