Base | Representation |
---|---|
bin | 10001101000110111111… |
… | …110111011010010011001 |
3 | 11021212200201122220222120 |
4 | 101220313332323102121 |
5 | 124324410211120441 |
6 | 2324501254411453 |
7 | 153400315113453 |
oct | 21506776732231 |
9 | 4255621586876 |
10 | 1212120020121 |
11 | 42806a17364a |
12 | 176b00660b89 |
13 | 8a3c158264a |
14 | 4294a0692d3 |
15 | 217e3c67966 |
hex | 11a37fbb499 |
1212120020121 has 4 divisors (see below), whose sum is σ = 1616160026832. Its totient is φ = 808080013412.
The previous prime is 1212120020099. The next prime is 1212120020147. The reversal of 1212120020121 is 1210200212121.
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 1212120020121 - 27 = 1212120019993 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1212120020121.
It is not an unprimeable number, because it can be changed into a prime (1212120020191) 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, 202020003351 + ... + 202020003356.
It is an arithmetic number, because the mean of its divisors is an integer number (404040006708).
Almost surely, 21212120020121 is an apocalyptic number.
It is an amenable number.
1212120020121 is a deficient number, since it is larger than the sum of its proper divisors (404040006711).
1212120020121 is an equidigital number, since it uses as much as digits as its factorization.
1212120020121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 404040006710.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 1212120020121 its reverse (1210200212121), we get a palindrome (2422320232242).
The spelling of 1212120020121 in words is "one trillion, two hundred twelve billion, one hundred twenty million, twenty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •