Base | Representation |
---|---|
bin | 11110111000011101100… |
… | …101110101100001000111 |
3 | 21111212210111002102211102 |
4 | 132320131211311201013 |
5 | 234232241314131043 |
6 | 4302532511530315 |
7 | 306216230634500 |
oct | 36703545654107 |
9 | 7455714072742 |
10 | 2122210302023 |
11 | 74902a431599 |
12 | 2a336bb2999b |
13 | 12517b649256 |
14 | 74a03595ba7 |
15 | 3a30c0376b8 |
hex | 1ee1d975847 |
2122210302023 has 48 divisors (see below), whose sum is σ = 2717640072000. Its totient is φ = 1644689249280.
The previous prime is 2122210302001. The next prime is 2122210302029. The reversal of 2122210302023 is 3202030122212.
It is a happy number.
It is not a de Polignac number, because 2122210302023 - 210 = 2122210300999 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2122210301986 and 2122210302004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2122210302029) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 4586513 + ... + 5027973.
It is an arithmetic number, because the mean of its divisors is an integer number (56617501500).
Almost surely, 22122210302023 is an apocalyptic number.
2122210302023 is a deficient number, since it is larger than the sum of its proper divisors (595429769977).
2122210302023 is a wasteful number, since it uses less digits than its factorization.
2122210302023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 441720 (or 441713 counting only the distinct ones).
The product of its (nonzero) digits is 576, while the sum is 20.
Adding to 2122210302023 its reverse (3202030122212), we get a palindrome (5324240424235).
The spelling of 2122210302023 in words is "two trillion, one hundred twenty-two billion, two hundred ten million, three hundred two thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •