Base | Representation |
---|---|
bin | 1011001110001001… |
… | …0111010011010000 |
3 | 21202220212001120101 |
4 | 2303202113103100 |
5 | 22132101130000 |
6 | 1214520222144 |
7 | 134433453055 |
oct | 26342272320 |
9 | 7686761511 |
10 | 3012130000 |
11 | 13062a5940 |
12 | 70090a954 |
13 | 390070759 |
14 | 20808302c |
15 | 12968ce6a |
hex | b38974d0 |
3012130000 has 200 divisors, whose sum is σ = 8053547040. Its totient is φ = 1081920000.
The previous prime is 3012129997. The next prime is 3012130001. The reversal of 3012130000 is 312103.
It is a tau number, because it is divible by the number of its divisors (200).
It is a Harshad number since it is a multiple of its sum of digits (10).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3012130001) by changing a digit.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 15289902 + ... + 15290098.
Almost surely, 23012130000 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 3012130000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (4026773520).
3012130000 is an abundant number, since it is smaller than the sum of its proper divisors (5041417040).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3012130000 is a wasteful number, since it uses less digits than its factorization.
3012130000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 375 (or 354 counting only the distinct ones).
The product of its (nonzero) digits is 18, while the sum is 10.
The square root of 3012130000 is about 54882.8752891100. The cubic root of 3012130000 is about 1444.1907882440.
Adding to 3012130000 its reverse (312103), we get a palindrome (3012442103).
The spelling of 3012130000 in words is "three billion, twelve million, one hundred thirty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •