Base | Representation |
---|---|
bin | 101101100101110101100… |
… | …010011001111010111000 |
3 | 102002111211101002102102202 |
4 | 231211311202121322320 |
5 | 402312342244041440 |
6 | 10355140505445332 |
7 | 442231511025260 |
oct | 55456542317270 |
9 | 12074741072382 |
10 | 3133003112120 |
11 | aa8776641452 |
12 | 4272444a0848 |
13 | 19959693864b |
14 | ab8d11787a0 |
15 | 5676b063615 |
hex | 2d975899eb8 |
3133003112120 has 96 divisors (see below), whose sum is σ = 8324558114400. Its totient is φ = 1039521680640.
The previous prime is 3133003112111. The next prime is 3133003112147. The reversal of 3133003112120 is 212113003313.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a junction number, because it is equal to n+sod(n) for n = 3133003112092 and 3133003112101.
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 23 ways as a sum of consecutive naturals, for example, 5552615 + ... + 6090774.
It is an arithmetic number, because the mean of its divisors is an integer number (86714147025).
Almost surely, 23133003112120 is an apocalyptic number.
It is an amenable number.
3133003112120 is an abundant number, since it is smaller than the sum of its proper divisors (5191555002280).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3133003112120 is a wasteful number, since it uses less digits than its factorization.
3133003112120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11643469 (or 11643434 counting only the distinct ones).
The product of its (nonzero) digits is 324, while the sum is 20.
Adding to 3133003112120 its reverse (212113003313), we get a palindrome (3345116115433).
The spelling of 3133003112120 in words is "three trillion, one hundred thirty-three billion, three million, one hundred twelve thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •