Base | Representation |
---|---|
bin | 1010111010100000010001… |
… | …0000101010101110101101 |
3 | 1120111012122021102110012221 |
4 | 2232220010100222232231 |
5 | 3033102412241300323 |
6 | 41304453113155341 |
7 | 2345662251606223 |
oct | 256500420525655 |
9 | 46435567373187 |
10 | 12000210103213 |
11 | 3907295838522 |
12 | 141987a0bbb51 |
13 | 6907cc0a3707 |
14 | 2d6b55870b13 |
15 | 15c2465c355d |
hex | aea0442abad |
12000210103213 has 8 divisors (see below), whose sum is σ = 12029275920096. Its totient is φ = 11971153194000.
The previous prime is 12000210103183. The next prime is 12000210103229. The reversal of 12000210103213 is 31230101200021.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 12000210103213 - 25 = 12000210103181 is a prime.
It is a super-2 number, since 2×120002101032132 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12000210703213) 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, 474663 + ... + 4921963.
It is an arithmetic number, because the mean of its divisors is an integer number (1503659490012).
Almost surely, 212000210103213 is an apocalyptic number.
It is an amenable number.
12000210103213 is a deficient number, since it is larger than the sum of its proper divisors (29065816883).
12000210103213 is an equidigital number, since it uses as much as digits as its factorization.
12000210103213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4453835.
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 12000210103213 its reverse (31230101200021), we get a palindrome (43230311303234).
The spelling of 12000210103213 in words is "twelve trillion, two hundred ten million, one hundred three thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •