Base | Representation |
---|---|
bin | 101101011010101010110… |
… | …011111100110011010000 |
3 | 102001100212200200220201010 |
4 | 231122222303330303100 |
5 | 402113313033031000 |
6 | 10345434554410520 |
7 | 441325405205454 |
oct | 55325263746320 |
9 | 12040780626633 |
10 | 3121012002000 |
11 | aa3682a01992 |
12 | 424a58730a40 |
13 | 198405597309 |
14 | ab0b47d2664 |
15 | 562b849bd50 |
hex | 2d6aacfccd0 |
3121012002000 has 160 divisors (see below), whose sum is σ = 10499627623680. Its totient is φ = 796084185600.
The previous prime is 3121012001999. The next prime is 3121012002019. The reversal of 3121012002000 is 2002101213.
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 31 ways as a sum of consecutive naturals, for example, 11170015 + ... + 11446014.
It is an arithmetic number, because the mean of its divisors is an integer number (65622672648).
Almost surely, 23121012002000 is an apocalyptic number.
3121012002000 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
It is an amenable number.
3121012002000 is an abundant number, since it is smaller than the sum of its proper divisors (7378615621680).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3121012002000 is a wasteful number, since it uses less digits than its factorization.
3121012002000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22616078 (or 22616062 counting only the distinct ones).
The product of its (nonzero) digits is 24, while the sum is 12.
Adding to 3121012002000 its reverse (2002101213), we get a palindrome (3123014103213).
The spelling of 3121012002000 in words is "three trillion, one hundred twenty-one billion, twelve million, two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •