Base | Representation |
---|---|
bin | 10001101000110110111… |
… | …010100110111100011001 |
3 | 11021212122110222001021211 |
4 | 101220312322212330121 |
5 | 124324341120023001 |
6 | 2324455414503121 |
7 | 153400006643335 |
oct | 21506672467431 |
9 | 4255573861254 |
10 | 1212102111001 |
11 | 428060051221 |
12 | 176ab6664aa1 |
13 | 8a3ba951b32 |
14 | 429479267c5 |
15 | 217e23cb351 |
hex | 11a36ea6f19 |
1212102111001 has 4 divisors (see below), whose sum is σ = 1212104990052. Its totient is φ = 1212099231952.
The previous prime is 1212102110983. The next prime is 1212102111013. The reversal of 1212102111001 is 1001112012121.
It is a happy number.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 51494501776 + 1160607609225 = 226924^2 + 1077315^2 .
It is a cyclic number.
It is not a de Polignac number, because 1212102111001 - 211 = 1212102108953 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1212102121001) 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, 671386 + ... + 1695571.
It is an arithmetic number, because the mean of its divisors is an integer number (303026247513).
Almost surely, 21212102111001 is an apocalyptic number.
It is an amenable number.
1212102111001 is a deficient number, since it is larger than the sum of its proper divisors (2879051).
1212102111001 is an equidigital number, since it uses as much as digits as its factorization.
1212102111001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2879050.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 1212102111001 its reverse (1001112012121), we get a palindrome (2213214123122).
The spelling of 1212102111001 in words is "one trillion, two hundred twelve billion, one hundred two million, one hundred eleven thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •