Base | Representation |
---|---|
bin | 1010111100001111101001… |
… | …1011110000101101100101 |
3 | 1120121001211001101002210220 |
4 | 2233003322123300231211 |
5 | 3034100131130311323 |
6 | 41330320052034553 |
7 | 2351101224614601 |
oct | 257037233605545 |
9 | 46531731332726 |
10 | 12030110010213 |
11 | 3918a39527169 |
12 | 1423623602a59 |
13 | 6935857c1889 |
14 | 2d83908a2501 |
15 | 15cde652a0e3 |
hex | af0fa6f0b65 |
12030110010213 has 8 divisors (see below), whose sum is σ = 16243186512000. Its totient is φ = 7918553424288.
The previous prime is 12030110010211. The next prime is 12030110010223. The reversal of 12030110010213 is 31201001103021.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 12030110010213 - 21 = 12030110010211 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 12030110010192 and 12030110010201.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12030110010211) 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, 25379978688 + ... + 25379979161.
It is an arithmetic number, because the mean of its divisors is an integer number (2030398314000).
Almost surely, 212030110010213 is an apocalyptic number.
It is an amenable number.
12030110010213 is a deficient number, since it is larger than the sum of its proper divisors (4213076501787).
12030110010213 is an equidigital number, since it uses as much as digits as its factorization.
12030110010213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 50759957931.
The product of its (nonzero) digits is 36, while the sum is 15.
Adding to 12030110010213 its reverse (31201001103021), we get a palindrome (43231111113234).
The spelling of 12030110010213 in words is "twelve trillion, thirty billion, one hundred ten million, ten thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •