Base | Representation |
---|---|
bin | 1011000110101110001010… |
… | …1011000101110110011001 |
3 | 1121020021101212022001122110 |
4 | 2301223202223011312121 |
5 | 3100022241100032301 |
6 | 41545124214142533 |
7 | 2400102442403043 |
oct | 261534253056631 |
9 | 47207355261573 |
10 | 12210100002201 |
11 | 3988302153162 |
12 | 1452495951a49 |
13 | 6a753b340a0a |
14 | 302d87214a93 |
15 | 16292ce080d6 |
hex | b1ae2ac5d99 |
12210100002201 has 16 divisors (see below), whose sum is σ = 16397537811200. Its totient is φ = 8081366439888.
The previous prime is 12210100002193. The next prime is 12210100002209. The reversal of 12210100002201 is 10220000101221.
It is an interprime number because it is at equal distance from previous prime (12210100002193) and next prime (12210100002209).
It is not a de Polignac number, because 12210100002201 - 23 = 12210100002193 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (12210100002209) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 27862950 + ... + 28297776.
It is an arithmetic number, because the mean of its divisors is an integer number (1024846113200).
Almost surely, 212210100002201 is an apocalyptic number.
It is an amenable number.
12210100002201 is a deficient number, since it is larger than the sum of its proper divisors (4187437808999).
12210100002201 is a wasteful number, since it uses less digits than its factorization.
12210100002201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 502308.
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 12210100002201 its reverse (10220000101221), we get a palindrome (22430100103422).
The spelling of 12210100002201 in words is "twelve trillion, two hundred ten billion, one hundred million, two thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •