Base | Representation |
---|---|
bin | 1000101001100111… |
… | …0001000000001001 |
3 | 12222211021100001212 |
4 | 2022121301000021 |
5 | 14223413310441 |
6 | 1022224422505 |
7 | 111353521544 |
oct | 21231610011 |
9 | 5884240055 |
10 | 2322010121 |
11 | a91794632 |
12 | 549777a35 |
13 | 2b00b04b2 |
14 | 18055b85b |
15 | d8cbceeb |
hex | 8a671009 |
2322010121 has 12 divisors (see below), whose sum is σ = 2452658544. Its totient is φ = 2197999800.
The previous prime is 2322010109. The next prime is 2322010129. The reversal of 2322010121 is 1210102232.
It is a happy number.
It is not a de Polignac number, because 2322010121 - 210 = 2322009097 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 2322010096 and 2322010105.
It is not an unprimeable number, because it can be changed into a prime (2322010129) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 695426 + ... + 698756.
It is an arithmetic number, because the mean of its divisors is an integer number (204388212).
Almost surely, 22322010121 is an apocalyptic number.
It is an amenable number.
2322010121 is a deficient number, since it is larger than the sum of its proper divisors (130648423).
2322010121 is a wasteful number, since it uses less digits than its factorization.
2322010121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5300 (or 5281 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 14.
The square root of 2322010121 is about 48187.2402301688. The cubic root of 2322010121 is about 1324.2034126809.
Adding to 2322010121 its reverse (1210102232), we get a palindrome (3532112353).
The spelling of 2322010121 in words is "two billion, three hundred twenty-two million, ten thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •