Base | Representation |
---|---|
bin | 10101100010001100… |
… | …100101000001011110 |
3 | 2012200102200121001100 |
4 | 111202030211001132 |
5 | 334323302113042 |
6 | 14342223053530 |
7 | 1445664213222 |
oct | 254214450136 |
9 | 65612617040 |
10 | 23122301022 |
11 | 9895a32a97 |
12 | 45937412a6 |
13 | 2246510532 |
14 | 1194c46782 |
15 | 904e1c24c |
hex | 56232505e |
23122301022 has 12 divisors (see below), whose sum is σ = 50098318920. Its totient is φ = 7707433668.
The previous prime is 23122301021. The next prime is 23122301087. The reversal of 23122301022 is 22010322132.
It is a Harshad number since it is a multiple of its sum of digits (18), and also a Moran number because the ratio is a prime number: 1284572279 = 23122301022 / (2 + 3 + 1 + 2 + 2 + 3 + 0 + 1 + 0 + 2 + 2).
It is a junction number, because it is equal to n+sod(n) for n = 23122300986 and 23122301004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (23122301021) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 642286122 + ... + 642286157.
It is an arithmetic number, because the mean of its divisors is an integer number (4174859910).
Almost surely, 223122301022 is an apocalyptic number.
23122301022 is an abundant number, since it is smaller than the sum of its proper divisors (26976017898).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
23122301022 is a wasteful number, since it uses less digits than its factorization.
23122301022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1284572287 (or 1284572284 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 18.
Adding to 23122301022 its reverse (22010322132), we get a palindrome (45132623154).
The spelling of 23122301022 in words is "twenty-three billion, one hundred twenty-two million, three hundred one thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •