Base | Representation |
---|---|
bin | 10001101000110111111… |
… | …111001110110101101001 |
3 | 11021212200201210222211111 |
4 | 101220313333032311221 |
5 | 124324410221201301 |
6 | 2324501300230321 |
7 | 153400315566103 |
oct | 21506777166551 |
9 | 4255621728744 |
10 | 1212120100201 |
11 | 42806a21882a |
12 | 176b0069b3a1 |
13 | 8a3c15acc2a |
14 | 4294a08a573 |
15 | 217e3c81551 |
hex | 11a37fced69 |
1212120100201 has 4 divisors (see below), whose sum is σ = 1212122517904. Its totient is φ = 1212117682500.
The previous prime is 1212120100189. The next prime is 1212120100223. The reversal of 1212120100201 is 1020010212121.
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 a cyclic number.
It is not a de Polignac number, because 1212120100201 - 213 = 1212120092009 is a prime.
It is a super-2 number, since 2×12121201002012 (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 (1212120100271) 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, 144375 + ... + 1563676.
It is an arithmetic number, because the mean of its divisors is an integer number (303030629476).
Almost surely, 21212120100201 is an apocalyptic number.
It is an amenable number.
1212120100201 is a deficient number, since it is larger than the sum of its proper divisors (2417703).
1212120100201 is an equidigital number, since it uses as much as digits as its factorization.
1212120100201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2417702.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 1212120100201 its reverse (1020010212121), we get a palindrome (2232130312322).
The spelling of 1212120100201 in words is "one trillion, two hundred twelve billion, one hundred twenty million, one hundred thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.118 sec. • engine limits •