Base | Representation |
---|---|
bin | 10001101000110010001… |
… | …001111011001100000001 |
3 | 11021212102220200011212122 |
4 | 101220302021323030001 |
5 | 124324210143140001 |
6 | 2324443442534025 |
7 | 153365020025306 |
oct | 21506211731401 |
9 | 4255386604778 |
10 | 1212022240001 |
11 | 428019a58a31 |
12 | 176a93967315 |
13 | 8a3a72383a1 |
14 | 4293b0950ad |
15 | 217da3a0b1b |
hex | 11a3227b301 |
1212022240001 has 4 divisors (see below), whose sum is σ = 1220048877504. Its totient is φ = 1203995602500.
The previous prime is 1212022239991. The next prime is 1212022240019. The reversal of 1212022240001 is 1000422202121.
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 1212022240001 - 26 = 1212022239937 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1212022240031) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4013318525 + ... + 4013318826.
It is an arithmetic number, because the mean of its divisors is an integer number (305012219376).
Almost surely, 21212022240001 is an apocalyptic number.
It is an amenable number.
1212022240001 is a deficient number, since it is larger than the sum of its proper divisors (8026637503).
1212022240001 is an equidigital number, since it uses as much as digits as its factorization.
1212022240001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8026637502.
The product of its (nonzero) digits is 128, while the sum is 17.
Adding to 1212022240001 its reverse (1000422202121), we get a palindrome (2212444442122).
The spelling of 1212022240001 in words is "one trillion, two hundred twelve billion, twenty-two million, two hundred forty thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •