Base | Representation |
---|---|
bin | 1010111011001000110101… |
… | …1110010101101011111101 |
3 | 1120112020202100122020012112 |
4 | 2232302031132111223331 |
5 | 3033242214114201341 |
6 | 41313454002343405 |
7 | 2346526210215440 |
oct | 256621536255375 |
9 | 46466670566175 |
10 | 12011102100221 |
11 | 3910975009044 |
12 | 141b9b995ab65 |
13 | 691846814963 |
14 | 2d74aa269657 |
15 | 15c68292baeb |
hex | aec8d795afd |
12011102100221 has 8 divisors (see below), whose sum is σ = 13727619154560. Its totient is φ = 10294746377328.
The previous prime is 12011102100161. The next prime is 12011102100223. The reversal of 12011102100221 is 12200120111021.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 12011102100221 - 26 = 12011102100157 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 12011102100196 and 12011102100205.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12011102100223) 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, 40173281 + ... + 40471158.
It is an arithmetic number, because the mean of its divisors is an integer number (1715952394320).
Almost surely, 212011102100221 is an apocalyptic number.
It is an amenable number.
12011102100221 is a deficient number, since it is larger than the sum of its proper divisors (1716517054339).
12011102100221 is an equidigital number, since it uses as much as digits as its factorization.
12011102100221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 80665723.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 12011102100221 its reverse (12200120111021), we get a palindrome (24211222211242).
The spelling of 12011102100221 in words is "twelve trillion, eleven billion, one hundred two million, one hundred thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.172 sec. • engine limits •