Base | Representation |
---|---|
bin | 10101011011000001… |
… | …110000000011100000 |
3 | 2012101001100210101220 |
4 | 111123001300003200 |
5 | 334102004201422 |
6 | 14322245055040 |
7 | 1443003650646 |
oct | 253301600340 |
9 | 65331323356 |
10 | 23002022112 |
11 | 9834050733 |
12 | 455b3b7480 |
13 | 2227619694 |
14 | 1182c97196 |
15 | 8e95ade5c |
hex | 55b0700e0 |
23002022112 has 24 divisors (see below), whose sum is σ = 60380308296. Its totient is φ = 7667340672.
The previous prime is 23002022039. The next prime is 23002022119. The reversal of 23002022112 is 21122020032.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (24).
It is a junction number, because it is equal to n+sod(n) for n = 23002022091 and 23002022100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (23002022119) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 119802103 + ... + 119802294.
It is an arithmetic number, because the mean of its divisors is an integer number (2515846179).
Almost surely, 223002022112 is an apocalyptic number.
It is an amenable number.
23002022112 is an abundant number, since it is smaller than the sum of its proper divisors (37378286184).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
23002022112 is a wasteful number, since it uses less digits than its factorization.
23002022112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 239604410 (or 239604402 counting only the distinct ones).
The product of its (nonzero) digits is 96, while the sum is 15.
Adding to 23002022112 its reverse (21122020032), we get a palindrome (44124042144).
The spelling of 23002022112 in words is "twenty-three billion, two million, twenty-two thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •