Base | Representation |
---|---|
bin | 1001100011001111011111… |
… | …11110010110110010011001 |
3 | 2202100210010221022121122101 |
4 | 10301213233332112302121 |
5 | 10223044321012223113 |
6 | 112400124041323401 |
7 | 4265232066536434 |
oct | 461475776266231 |
9 | 82323127277571 |
10 | 21002121211033 |
11 | 6767a499991a6 |
12 | 2432427a96561 |
13 | b94650b85b21 |
14 | 5287182b281b |
15 | 2664a79542dd |
hex | 1319eff96c99 |
21002121211033 has 2 divisors, whose sum is σ = 21002121211034. Its totient is φ = 21002121211032.
The previous prime is 21002121210997. The next prime is 21002121211051. The reversal of 21002121211033 is 33011212120012.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 12755276531209 + 8246844679824 = 3571453^2 + 2871732^2 .
It is a cyclic number.
It is not a de Polignac number, because 21002121211033 - 225 = 21002087656601 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 21002121211033.
It is not a weakly prime, because it can be changed into another prime (21002121211633) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10501060605516 + 10501060605517.
It is an arithmetic number, because the mean of its divisors is an integer number (10501060605517).
Almost surely, 221002121211033 is an apocalyptic number.
It is an amenable number.
21002121211033 is a deficient number, since it is larger than the sum of its proper divisors (1).
21002121211033 is an equidigital number, since it uses as much as digits as its factorization.
21002121211033 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 144, while the sum is 19.
Adding to 21002121211033 its reverse (33011212120012), we get a palindrome (54013333331045).
The spelling of 21002121211033 in words is "twenty-one trillion, two billion, one hundred twenty-one million, two hundred eleven thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •