Base | Representation |
---|---|
bin | 1011000000010100000011… |
… | …0011110100110010011101 |
3 | 1120211202020111220200010010 |
4 | 2300011000303310302131 |
5 | 3041221310102401341 |
6 | 41422400135433433 |
7 | 2356124350463166 |
oct | 260050063646235 |
9 | 46752214820103 |
10 | 12100010200221 |
11 | 3945649347539 |
12 | 1435090b25879 |
13 | 69a045361058 |
14 | 2db90213676d |
15 | 15eb37ec2716 |
hex | b0140cf4c9d |
12100010200221 has 16 divisors (see below), whose sum is σ = 16387780308480. Its totient is φ = 7940269666560.
The previous prime is 12100010200141. The next prime is 12100010200237. The reversal of 12100010200221 is 12200201000121.
It is not a de Polignac number, because 12100010200221 - 27 = 12100010200093 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 12100010200197 and 12100010200206.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12100010200321) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 101551200 + ... + 101670281.
It is an arithmetic number, because the mean of its divisors is an integer number (1024236269280).
Almost surely, 212100010200221 is an apocalyptic number.
It is an amenable number.
12100010200221 is a deficient number, since it is larger than the sum of its proper divisors (4287770108259).
12100010200221 is a wasteful number, since it uses less digits than its factorization.
12100010200221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 203221796.
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 12100010200221 its reverse (12200201000121), we get a palindrome (24300211200342).
The spelling of 12100010200221 in words is "twelve trillion, one hundred billion, ten million, two hundred thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •