Base | Representation |
---|---|
bin | 1001100110011110100101… |
… | …10011101101100001111001 |
3 | 2202202102010020202122210111 |
4 | 10303033102303231201321 |
5 | 10231410020030443113 |
6 | 112523152214544321 |
7 | 4306246165446361 |
oct | 463172263554171 |
9 | 82672106678714 |
10 | 21113301031033 |
11 | 6800112011562 |
12 | 244ba959680a1 |
13 | ba1c8b92cb73 |
14 | 52dc640519a1 |
15 | 2693133ed13d |
hex | 1333d2ced879 |
21113301031033 has 2 divisors, whose sum is σ = 21113301031034. Its totient is φ = 21113301031032.
The previous prime is 21113301031001. The next prime is 21113301031037. The reversal of 21113301031033 is 33013010331112.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 21074315318329 + 38985712704 = 4590677^2 + 197448^2 .
It is a cyclic number.
It is not a de Polignac number, because 21113301031033 - 25 = 21113301031001 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 21113301030995 and 21113301031013.
It is not a weakly prime, because it can be changed into another prime (21113301031037) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10556650515516 + 10556650515517.
It is an arithmetic number, because the mean of its divisors is an integer number (10556650515517).
Almost surely, 221113301031033 is an apocalyptic number.
It is an amenable number.
21113301031033 is a deficient number, since it is larger than the sum of its proper divisors (1).
21113301031033 is an equidigital number, since it uses as much as digits as its factorization.
21113301031033 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 486, while the sum is 22.
Adding to 21113301031033 its reverse (33013010331112), we get a palindrome (54126311362145).
The spelling of 21113301031033 in words is "twenty-one trillion, one hundred thirteen billion, three hundred one million, thirty-one thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •