Base | Representation |
---|---|
bin | 1011001011111101011100… |
… | …1110101010000100010101 |
3 | 1121112212201021112010111210 |
4 | 2302333113032222010111 |
5 | 3103011102142442323 |
6 | 42054331120052033 |
7 | 2406440000410242 |
oct | 262772716520425 |
9 | 47485637463453 |
10 | 12300102312213 |
11 | 3a12498101851 |
12 | 1467a13464019 |
13 | 6b2b82791561 |
14 | 3074845545c9 |
15 | 164e4958e293 |
hex | b2fd73aa115 |
12300102312213 has 8 divisors (see below), whose sum is σ = 16401728240128. Its totient is φ = 8199272296224.
The previous prime is 12300102312137. The next prime is 12300102312221. The reversal of 12300102312213 is 31221320100321.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 12300102312213 - 214 = 12300102295829 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 12300102312213.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12300102312913) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 198941920 + ... + 199003737.
It is an arithmetic number, because the mean of its divisors is an integer number (2050216030016).
Almost surely, 212300102312213 is an apocalyptic number.
It is an amenable number.
12300102312213 is a deficient number, since it is larger than the sum of its proper divisors (4101625927915).
12300102312213 is a wasteful number, since it uses less digits than its factorization.
12300102312213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 397955963.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 12300102312213 its reverse (31221320100321), we get a palindrome (43521422412534).
The spelling of 12300102312213 in words is "twelve trillion, three hundred billion, one hundred two million, three hundred twelve thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •