Base | Representation |
---|---|
bin | 1001100110000111101100… |
… | …10001000000010111001111 |
3 | 2202201020101201220221210012 |
4 | 10303003312101000113033 |
5 | 10231204332304323043 |
6 | 112513400505103435 |
7 | 4305332503140266 |
oct | 463036621002717 |
9 | 82636351827705 |
10 | 21101011011023 |
11 | 67a5985682629 |
12 | 2449625a87b7b |
13 | ba0a80682c88 |
14 | 52d419adb5dd |
15 | 268d44490a18 |
hex | 1330f64405cf |
21101011011023 has 2 divisors, whose sum is σ = 21101011011024. Its totient is φ = 21101011011022.
The previous prime is 21101011011007. The next prime is 21101011011077. The reversal of 21101011011023 is 32011011010112.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 21101011011023 - 24 = 21101011011007 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 21101011010989 and 21101011011007.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (21101011011523) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10550505505511 + 10550505505512.
It is an arithmetic number, because the mean of its divisors is an integer number (10550505505512).
Almost surely, 221101011011023 is an apocalyptic number.
21101011011023 is a deficient number, since it is larger than the sum of its proper divisors (1).
21101011011023 is an equidigital number, since it uses as much as digits as its factorization.
21101011011023 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12, while the sum is 14.
Adding to 21101011011023 its reverse (32011011010112), we get a palindrome (53112022021135).
The spelling of 21101011011023 in words is "twenty-one trillion, one hundred one billion, eleven million, eleven thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •