Base | Representation |
---|---|
bin | 101011110110001011111… |
… | …100101000011111010000 |
3 | 101200001101111212102201010 |
4 | 223312023330220133100 |
5 | 343331332210031000 |
6 | 10224112550410520 |
7 | 430455631301553 |
oct | 53661374503720 |
9 | 11601344772633 |
10 | 3013120002000 |
11 | a61947764439 |
12 | 407b67960a40 |
13 | 18b19ca296b4 |
14 | a5b9b57c69a |
15 | 535a149bd50 |
hex | 2bd8bf287d0 |
3013120002000 has 80 divisors (see below), whose sum is σ = 9714298905792. Its totient is φ = 803498665600.
The previous prime is 3013120001993. The next prime is 3013120002031. The reversal of 3013120002000 is 2000213103.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (80).
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 pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 251087334 + ... + 251099333.
Almost surely, 23013120002000 is an apocalyptic number.
3013120002000 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
It is an amenable number.
3013120002000 is an abundant number, since it is smaller than the sum of its proper divisors (6701178903792).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3013120002000 is a wasteful number, since it uses less digits than its factorization.
3013120002000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 502186693 (or 502186677 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 12.
Adding to 3013120002000 its reverse (2000213103), we get a palindrome (3015120215103).
The spelling of 3013120002000 in words is "three trillion, thirteen billion, one hundred twenty million, two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •