Base | Representation |
---|---|
bin | 1011000110101110100101… |
… | …0110110010011000110111 |
3 | 1121020021200200021020111221 |
4 | 2301223221112302120313 |
5 | 3100023003300320434 |
6 | 41545143301211211 |
7 | 2400105303365326 |
oct | 261535126623067 |
9 | 47207620236457 |
10 | 12210212120119 |
11 | 398835a470aa2 |
12 | 1452507400b07 |
13 | 6a7558638090 |
14 | 302d9807c0bd |
15 | 162937ba32b4 |
hex | b1ae95b2637 |
12210212120119 has 4 divisors (see below), whose sum is σ = 13149459206296. Its totient is φ = 11270965033944.
The previous prime is 12210212120089. The next prime is 12210212120129. The reversal of 12210212120119 is 91102121201221.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 12210212120119 - 233 = 12201622185527 is a prime.
It is a super-2 number, since 2×122102121201192 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 12210212120093 and 12210212120102.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12210212120129) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 469623543069 + ... + 469623543094.
It is an arithmetic number, because the mean of its divisors is an integer number (3287364801574).
Almost surely, 212210212120119 is an apocalyptic number.
12210212120119 is a deficient number, since it is larger than the sum of its proper divisors (939247086177).
12210212120119 is an equidigital number, since it uses as much as digits as its factorization.
12210212120119 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 939247086176.
The product of its (nonzero) digits is 288, while the sum is 25.
The spelling of 12210212120119 in words is "twelve trillion, two hundred ten billion, two hundred twelve million, one hundred twenty thousand, one hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •