Base | Representation |
---|---|
bin | 101011111100100111010… |
… | …011000000000000110100 |
3 | 101200201012110212202120220 |
4 | 223330213103000000310 |
5 | 343440000423120200 |
6 | 10231213441254340 |
7 | 431121641336643 |
oct | 53744723000064 |
9 | 11621173782526 |
10 | 3020021301300 |
11 | a64869324783 |
12 | 4093730343b0 |
13 | 18ba2c755353 |
14 | a6253d6535a |
15 | 538572bb4a0 |
hex | 2bf274c0034 |
3020021301300 has 72 divisors (see below), whose sum is σ = 8738142285600. Its totient is φ = 805319291520.
The previous prime is 3020021301281. The next prime is 3020021301383. The reversal of 3020021301300 is 31031200203.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 3020021301300.
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, 15400266 + ... + 15595134.
It is an arithmetic number, because the mean of its divisors is an integer number (121363087300).
Almost surely, 23020021301300 is an apocalyptic number.
3020021301300 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
It is an amenable number.
3020021301300 is an abundant number, since it is smaller than the sum of its proper divisors (5718120984300).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3020021301300 is a wasteful number, since it uses less digits than its factorization.
3020021301300 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 246545 (or 246538 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 15.
Adding to 3020021301300 its reverse (31031200203), we get a palindrome (3051052501503).
The spelling of 3020021301300 in words is "three trillion, twenty billion, twenty-one million, three hundred one thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •