Base | Representation |
---|---|
bin | 1011010110000000… |
… | …1111111100010000 |
3 | 21212012221122001121 |
4 | 2311200033330100 |
5 | 22214023130000 |
6 | 1222055412024 |
7 | 135314115013 |
oct | 26540177420 |
9 | 7765848047 |
10 | 3045130000 |
11 | 1322995270 |
12 | 70b984014 |
13 | 396b56093 |
14 | 20c5d337a |
15 | 12c50ab1a |
hex | b580ff10 |
3045130000 has 400 divisors, whose sum is σ = 8925143040. Its totient is φ = 993600000.
The previous prime is 3045129991. The next prime is 3045130001. The reversal of 3045130000 is 315403.
It is a tau number, because it is divible by the number of its divisors (400).
It is a Harshad number since it is a multiple of its sum of digits (16).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3045130001) by changing a digit.
It is a polite number, since it can be written in 79 ways as a sum of consecutive naturals, for example, 64789977 + ... + 64790023.
Almost surely, 23045130000 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 3045130000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (4462571520).
3045130000 is an abundant number, since it is smaller than the sum of its proper divisors (5880013040).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3045130000 is a wasteful number, since it uses less digits than its factorization.
3045130000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 136 (or 115 counting only the distinct ones).
The product of its (nonzero) digits is 180, while the sum is 16.
The square root of 3045130000 is about 55182.6965633250. The cubic root of 3045130000 is about 1449.4456858615.
Adding to 3045130000 its reverse (315403), we get a palindrome (3045445403).
The spelling of 3045130000 in words is "three billion, forty-five million, one hundred thirty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •