Base | Representation |
---|---|
bin | 100010010111101011001111… |
… | …1101000100001111000001100 |
3 | 1110122102121200102210122111210 |
4 | 1010233112133220201320030 |
5 | 304111212134041400022 |
6 | 2550552224345214420 |
7 | 120451660314234561 |
oct | 10457263750417014 |
9 | 1418377612718453 |
10 | 302321131200012 |
11 | 88368743080971 |
12 | 29aa7a3b191410 |
13 | cc8c9b6628622 |
14 | 54925c6a50868 |
15 | 24e40ee211a0c |
hex | 112f59fa21e0c |
302321131200012 has 48 divisors (see below), whose sum is σ = 706187639535840. Its totient is φ = 100663476092928.
The previous prime is 302321131200007. The next prime is 302321131200017. The reversal of 302321131200012 is 210002131123203.
It is an interprime number because it is at equal distance from previous prime (302321131200007) and next prime (302321131200017).
It is not an unprimeable number, because it can be changed into a prime (302321131200017) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 742175148 + ... + 742582380.
It is an arithmetic number, because the mean of its divisors is an integer number (14712242490330).
Almost surely, 2302321131200012 is an apocalyptic number.
It is an amenable number.
302321131200012 is an abundant number, since it is smaller than the sum of its proper divisors (403866508335828).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
302321131200012 is a wasteful number, since it uses less digits than its factorization.
302321131200012 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 474762 (or 474760 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 302321131200012 its reverse (210002131123203), we get a palindrome (512323262323215).
The spelling of 302321131200012 in words is "three hundred two trillion, three hundred twenty-one billion, one hundred thirty-one million, two hundred thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •