Base | Representation |
---|---|
bin | 11110110111101000000… |
… | …000111010101100001001 |
3 | 21111210110211201002012002 |
4 | 132313220000322230021 |
5 | 234223421211301213 |
6 | 4302303402000345 |
7 | 306155034441515 |
oct | 36675000725411 |
9 | 7453424632162 |
10 | 2121311431433 |
11 | 748709000837 |
12 | 2a315aaa60b5 |
13 | 12506735996c |
14 | 7495a051145 |
15 | 3a2a8180658 |
hex | 1ede803ab09 |
2121311431433 has 2 divisors, whose sum is σ = 2121311431434. Its totient is φ = 2121311431432.
The previous prime is 2121311431427. The next prime is 2121311431517. The reversal of 2121311431433 is 3341341131212.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1777496899984 + 343814531449 = 1333228^2 + 586357^2 .
It is a cyclic number.
It is not a de Polignac number, because 2121311431433 - 214 = 2121311415049 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 2121311431396 and 2121311431405.
It is not a weakly prime, because it can be changed into another prime (2121311431133) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1060655715716 + 1060655715717.
It is an arithmetic number, because the mean of its divisors is an integer number (1060655715717).
Almost surely, 22121311431433 is an apocalyptic number.
It is an amenable number.
2121311431433 is a deficient number, since it is larger than the sum of its proper divisors (1).
2121311431433 is an equidigital number, since it uses as much as digits as its factorization.
2121311431433 is an evil number, because the sum of its binary digits is even.
The product of its digits is 5184, while the sum is 29.
Adding to 2121311431433 its reverse (3341341131212), we get a palindrome (5462652562645).
The spelling of 2121311431433 in words is "two trillion, one hundred twenty-one billion, three hundred eleven million, four hundred thirty-one thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •