Base | Representation |
---|---|
bin | 1001101001111101110001… |
… | …01101101010101010100011 |
3 | 2210011212101210122222002212 |
4 | 10310332320231222222203 |
5 | 10240340413303314412 |
6 | 113054210045032335 |
7 | 4321020364564412 |
oct | 464767055525243 |
9 | 83155353588085 |
10 | 21233122323107 |
11 | 6846a0a006782 |
12 | 246b1558556ab |
13 | bb0375aa64a6 |
14 | 53598d759479 |
15 | 26c4c7853222 |
hex | 134fb8b6aaa3 |
21233122323107 has 2 divisors, whose sum is σ = 21233122323108. Its totient is φ = 21233122323106.
The previous prime is 21233122323089. The next prime is 21233122323139. The reversal of 21233122323107 is 70132322133212.
It is an a-pointer prime, because the next prime (21233122323139) can be obtained adding 21233122323107 to its sum of digits (32).
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 21233122323107 - 220 = 21233121274531 is a prime.
It is a super-2 number, since 2×212331223231072 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (21233122323187) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10616561161553 + 10616561161554.
It is an arithmetic number, because the mean of its divisors is an integer number (10616561161554).
Almost surely, 221233122323107 is an apocalyptic number.
21233122323107 is a deficient number, since it is larger than the sum of its proper divisors (1).
21233122323107 is an equidigital number, since it uses as much as digits as its factorization.
21233122323107 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 18144, while the sum is 32.
Adding to 21233122323107 its reverse (70132322133212), we get a palindrome (91365444456319).
The spelling of 21233122323107 in words is "twenty-one trillion, two hundred thirty-three billion, one hundred twenty-two million, three hundred twenty-three thousand, one hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •