Base | Representation |
---|---|
bin | 1011010000000110… |
… | …0010001111110100 |
3 | 21210111020012111010 |
4 | 2310001202033310 |
5 | 22141144120200 |
6 | 1215411312220 |
7 | 134563065102 |
oct | 26401421764 |
9 | 7714205433 |
10 | 3020301300 |
11 | 130a977085 |
12 | 7035ab670 |
13 | 391971b43 |
14 | 2091acc72 |
15 | 12a254150 |
hex | b40623f4 |
3020301300 has 72 divisors (see below), whose sum is σ = 8807658496. Its totient is φ = 799061760.
The previous prime is 3020301283. The next prime is 3020301337. The reversal of 3020301300 is 31030203.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1537 + ... + 77736.
Almost surely, 23020301300 is an apocalyptic number.
3020301300 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 3020301300, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (4403829248).
3020301300 is an abundant number, since it is smaller than the sum of its proper divisors (5787357196).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3020301300 is a wasteful number, since it uses less digits than its factorization.
3020301300 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 79417 (or 79410 counting only the distinct ones).
The product of its (nonzero) digits is 54, while the sum is 12.
The square root of 3020301300 is about 54957.2679451954. The cubic root of 3020301300 is about 1445.4955416991.
Adding to 3020301300 its reverse (31030203), we get a palindrome (3051331503).
The spelling of 3020301300 in words is "three billion, twenty million, three hundred one thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.109 sec. • engine limits •