Base | Representation |
---|---|
bin | 100010010101010110101100… |
… | …0100110111000000000100100 |
3 | 1110121022010020102220100211110 |
4 | 1010222231120212320000210 |
5 | 304041000311133113012 |
6 | 2550145504400505020 |
7 | 120416634603636441 |
oct | 10452553046700044 |
9 | 1417263212810743 |
10 | 302002112004132 |
11 | 88255416058271 |
12 | 29a5604831b170 |
13 | cc688a539ab77 |
14 | 5480da19b89c8 |
15 | 24dab7be7573c |
hex | 112ab589b8024 |
302002112004132 has 12 divisors (see below), whose sum is σ = 704671594676336. Its totient is φ = 100667370668040.
The previous prime is 302002112004121. The next prime is 302002112004149. The reversal of 302002112004132 is 231400211200203.
It is a tau number, because it is divible by the number of its divisors (12).
It is a junction number, because it is equal to n+sod(n) for n = 302002112004099 and 302002112004108.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 12583421333494 + ... + 12583421333517.
Almost surely, 2302002112004132 is an apocalyptic number.
It is an amenable number.
302002112004132 is an abundant number, since it is smaller than the sum of its proper divisors (402669482672204).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
302002112004132 is a wasteful number, since it uses less digits than its factorization.
302002112004132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25166842667018 (or 25166842667016 counting only the distinct ones).
The product of its (nonzero) digits is 576, while the sum is 21.
Adding to 302002112004132 its reverse (231400211200203), we get a palindrome (533402323204335).
The spelling of 302002112004132 in words is "three hundred two trillion, two billion, one hundred twelve million, four thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •