Base | Representation |
---|---|
bin | 101011111100100110101… |
… | …100111001001110000000 |
3 | 101200201011210002020211211 |
4 | 223330212230321032000 |
5 | 343434440343441000 |
6 | 10231212443215504 |
7 | 431121460413424 |
oct | 53744654711600 |
9 | 11621153066754 |
10 | 3020011312000 |
11 | a64863721661 |
12 | 40936b817594 |
13 | 18ba2a668617 |
14 | a62528c4b84 |
15 | 538564967ba |
hex | 2bf26b39380 |
3020011312000 has 64 divisors (see below), whose sum is σ = 7508503164240. Its totient is φ = 1208004518400.
The previous prime is 3020011311997. The next prime is 3020011312001. The reversal of 3020011312000 is 2131100203.
3020011312000 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a tau number, because it is divible by the number of its divisors (64).
It is a super-2 number, since 2×30200113120002 (a number of 26 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3020011312001) 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, 94359354 + ... + 94391353.
Almost surely, 23020011312000 is an apocalyptic number.
It is an amenable number.
3020011312000 is an abundant number, since it is smaller than the sum of its proper divisors (4488491852240).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3020011312000 is an equidigital number, since it uses as much as digits as its factorization.
3020011312000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 188750736 (or 188750714 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 13.
Adding to 3020011312000 its reverse (2131100203), we get a palindrome (3022142412203).
The spelling of 3020011312000 in words is "three trillion, twenty billion, eleven million, three hundred twelve thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.098 sec. • engine limits •