Base | Representation |
---|---|
bin | 100000000100101111111… |
… | …011000000010111110111 |
3 | 21210201020001211000021011 |
4 | 200010233323000113313 |
5 | 242103020242020043 |
6 | 4404320524333051 |
7 | 315146126514163 |
oct | 40045773002767 |
9 | 7721201730234 |
10 | 2204122220023 |
11 | 77a843593999 |
12 | 2b72100a4187 |
13 | 12cb038c8499 |
14 | 7897421bca3 |
15 | 3c5032ba59d |
hex | 2012fec05f7 |
2204122220023 has 2 divisors, whose sum is σ = 2204122220024. Its totient is φ = 2204122220022.
The previous prime is 2204122220021. The next prime is 2204122220057. The reversal of 2204122220023 is 3200222214022.
2204122220023 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 2204122220023 - 21 = 2204122220021 is a prime.
Together with 2204122220021, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 2204122219976 and 2204122220003.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2204122220021) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1102061110011 + 1102061110012.
It is an arithmetic number, because the mean of its divisors is an integer number (1102061110012).
Almost surely, 22204122220023 is an apocalyptic number.
2204122220023 is a deficient number, since it is larger than the sum of its proper divisors (1).
2204122220023 is an equidigital number, since it uses as much as digits as its factorization.
2204122220023 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1536, while the sum is 22.
Adding to 2204122220023 its reverse (3200222214022), we get a palindrome (5404344434045).
The spelling of 2204122220023 in words is "two trillion, two hundred four billion, one hundred twenty-two million, two hundred twenty thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •