Base | Representation |
---|---|
bin | 10101100010101010… |
… | …010101100011111100 |
3 | 2012200222100220222220 |
4 | 111202222111203330 |
5 | 334332301231022 |
6 | 14343102205340 |
7 | 1446120423513 |
oct | 254252254374 |
9 | 65628326886 |
10 | 23130102012 |
11 | 989a380a96 |
12 | 4596283850 |
13 | 22480121c4 |
14 | 1195cb767a |
15 | 90595d85c |
hex | 562a958fc |
23130102012 has 48 divisors (see below), whose sum is σ = 57262544640. Its totient is φ = 7241571072.
The previous prime is 23130101999. The next prime is 23130102019. The reversal of 23130102012 is 21020103132.
It is a junction number, because it is equal to n+sod(n) for n = 23130101982 and 23130102000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (23130102019) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 17062 + ... + 215757.
It is an arithmetic number, because the mean of its divisors is an integer number (1192969680).
Almost surely, 223130102012 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 23130102012, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (28631272320).
23130102012 is an abundant number, since it is smaller than the sum of its proper divisors (34132442628).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
23130102012 is a wasteful number, since it uses less digits than its factorization.
23130102012 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 233330 (or 233328 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 15.
Adding to 23130102012 its reverse (21020103132), we get a palindrome (44150205144).
The spelling of 23130102012 in words is "twenty-three billion, one hundred thirty million, one hundred two thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •