Base | Representation |
---|---|
bin | 10101011010111110… |
… | …101010100001100110 |
3 | 2012100222211200112220 |
4 | 111122332222201212 |
5 | 334101302304110 |
6 | 14322215453210 |
7 | 1442664041055 |
oct | 253276524146 |
9 | 65328750486 |
10 | 23001213030 |
11 | 9833648874 |
12 | 455b087206 |
13 | 22273c5333 |
14 | 1182b2639c |
15 | 8e949e370 |
hex | 55afaa866 |
23001213030 has 64 divisors (see below), whose sum is σ = 56007488448. Its totient is φ = 6044405760.
The previous prime is 23001212989. The next prime is 23001213031. The reversal of 23001213030 is 3031210032.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (23001213031) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2976732 + ... + 2984448.
It is an arithmetic number, because the mean of its divisors is an integer number (875117007).
Almost surely, 223001213030 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 23001213030, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (28003744224).
23001213030 is an abundant number, since it is smaller than the sum of its proper divisors (33006275418).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
23001213030 is a wasteful number, since it uses less digits than its factorization.
23001213030 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9161.
The product of its (nonzero) digits is 108, while the sum is 15.
Adding to 23001213030 its reverse (3031210032), we get a palindrome (26032423062).
The spelling of 23001213030 in words is "twenty-three billion, one million, two hundred thirteen thousand, thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •