Base | Representation |
---|---|
bin | 10101011011000010… |
… | …111110010000010110 |
3 | 2012101001222001210020 |
4 | 111123002332100112 |
5 | 334102044424142 |
6 | 14322300010010 |
7 | 1443006453543 |
oct | 253302762026 |
9 | 65331861706 |
10 | 23002342422 |
11 | 983424a354 |
12 | 455b530906 |
13 | 22276cc407 |
14 | 1182d3bbca |
15 | 8e9623cec |
hex | 55b0be416 |
23002342422 has 32 divisors (see below), whose sum is σ = 49898921184. Its totient is φ = 7040409600.
The previous prime is 23002342421. The next prime is 23002342423. The reversal of 23002342422 is 22424320032.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (23002342421) and next prime (23002342423).
It is a junction number, because it is equal to n+sod(n) for n = 23002342392 and 23002342401.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (23002342421) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2745979 + ... + 2754342.
It is an arithmetic number, because the mean of its divisors is an integer number (1559341287).
Almost surely, 223002342422 is an apocalyptic number.
23002342422 is an abundant number, since it is smaller than the sum of its proper divisors (26896578762).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
23002342422 is a wasteful number, since it uses less digits than its factorization.
23002342422 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5500384.
The product of its (nonzero) digits is 4608, while the sum is 24.
Adding to 23002342422 its reverse (22424320032), we get a palindrome (45426662454).
The spelling of 23002342422 in words is "twenty-three billion, two million, three hundred forty-two thousand, four hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.593 sec. • engine limits •