Base | Representation |
---|---|
bin | 11110110111101000100… |
… | …110001110110001101001 |
3 | 21111210111112010001000120 |
4 | 132313220212032301221 |
5 | 234223431212304113 |
6 | 4302304351353453 |
7 | 306155213541351 |
oct | 36675046166151 |
9 | 7453445101016 |
10 | 2121321213033 |
11 | 748713581900 |
12 | 2a3162222889 |
13 | 1250693a2ca9 |
14 | 7495b479b61 |
15 | 3a2a8e63a23 |
hex | 1ede898ec69 |
2121321213033 has 12 divisors (see below), whose sum is σ = 3108933568944. Its totient is φ = 1285649219800.
The previous prime is 2121321213017. The next prime is 2121321213071. The reversal of 2121321213033 is 3303121231212.
It is not a de Polignac number, because 2121321213033 - 24 = 2121321213017 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2121321212994 and 2121321213012.
It is not an unprimeable number, because it can be changed into a prime (2121321213433) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 2921929683 + ... + 2921930408.
It is an arithmetic number, because the mean of its divisors is an integer number (259077797412).
Almost surely, 22121321213033 is an apocalyptic number.
It is an amenable number.
2121321213033 is a deficient number, since it is larger than the sum of its proper divisors (987612355911).
2121321213033 is a wasteful number, since it uses less digits than its factorization.
2121321213033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5843860116 (or 5843860105 counting only the distinct ones).
The product of its (nonzero) digits is 1296, while the sum is 24.
Adding to 2121321213033 its reverse (3303121231212), we get a palindrome (5424442444245).
The spelling of 2121321213033 in words is "two trillion, one hundred twenty-one billion, three hundred twenty-one million, two hundred thirteen thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •