Base | Representation |
---|---|
bin | 101011111100101100000… |
… | …011011111000101000000 |
3 | 101200201102001001222200220 |
4 | 223330230003133011000 |
5 | 343440131341322240 |
6 | 10231225412143040 |
7 | 431123630650314 |
oct | 53745403370500 |
9 | 11621361058626 |
10 | 3020101120320 |
11 | a648aa391a09 |
12 | 409395907a80 |
13 | 18ba4315123b |
14 | a62607c1b44 |
15 | 5385e2d65d0 |
hex | 2bf2c0df140 |
3020101120320 has 56 divisors (see below), whose sum is σ = 9588821060064. Its totient is φ = 805360298496.
The previous prime is 3020101120301. The next prime is 3020101120327. The reversal of 3020101120320 is 230211010203.
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 3020101120320.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3020101120327) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1572968374 + ... + 1572970293.
Almost surely, 23020101120320 is an apocalyptic number.
3020101120320 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
It is an amenable number.
3020101120320 is an abundant number, since it is smaller than the sum of its proper divisors (6568719939744).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3020101120320 is a wasteful number, since it uses less digits than its factorization.
3020101120320 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3145938687 (or 3145938677 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 15.
Adding to 3020101120320 its reverse (230211010203), we get a palindrome (3250312130523).
The spelling of 3020101120320 in words is "three trillion, twenty billion, one hundred one million, one hundred twenty thousand, three hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •