Base | Representation |
---|---|
bin | 101011110101011100111… |
… | …111110010011101011000 |
3 | 101122222100121200000212102 |
4 | 223311130333302131120 |
5 | 343323224032100440 |
6 | 10223502451302532 |
7 | 430430255035613 |
oct | 53653477623530 |
9 | 11588317600772 |
10 | 3012332300120 |
11 | a61583063350 |
12 | 407987baaa48 |
13 | 18b0a5791400 |
14 | a5b24ad517a |
15 | 53557253b15 |
hex | 2bd5cff2758 |
3012332300120 has 192 divisors, whose sum is σ = 8008938050400. Its totient is φ = 1010814504960.
The previous prime is 3012332300071. The next prime is 3012332300141. The reversal of 3012332300120 is 210032332103.
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 = 3012332300092 and 3012332300101.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 452774714 + ... + 452781366.
Almost surely, 23012332300120 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 3012332300120, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (4004469025200).
3012332300120 is an abundant number, since it is smaller than the sum of its proper divisors (4996605750280).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3012332300120 is a wasteful number, since it uses less digits than its factorization.
3012332300120 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 12790 (or 12773 counting only the distinct ones).
The product of its (nonzero) digits is 648, while the sum is 20.
Adding to 3012332300120 its reverse (210032332103), we get a palindrome (3222364632223).
The spelling of 3012332300120 in words is "three trillion, twelve billion, three hundred thirty-two million, three hundred thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •