Base | Representation |
---|---|
bin | 10110101110011111… |
… | …00000001011110101 |
3 | 1011111022112002201101 |
4 | 23113033200023311 |
5 | 144441440200041 |
6 | 5334411530101 |
7 | 611232432115 |
oct | 132717401365 |
9 | 34438462641 |
10 | 12201100021 |
11 | 51a1226040 |
12 | 2446159931 |
13 | 11c5a15716 |
14 | 83a609045 |
15 | 4b6245b31 |
hex | 2d73e02f5 |
12201100021 has 24 divisors (see below), whose sum is σ = 14074920288. Its totient is φ = 10487772000.
The previous prime is 12201099991. The next prime is 12201100049. The reversal of 12201100021 is 12000110221.
It is not a de Polignac number, because 12201100021 - 27 = 12201099893 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 12201099980 and 12201100007.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12201100091) 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 23 ways as a sum of consecutive naturals, for example, 2264751 + ... + 2270131.
It is an arithmetic number, because the mean of its divisors is an integer number (586455012).
Almost surely, 212201100021 is an apocalyptic number.
12201100021 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
12201100021 is a deficient number, since it is larger than the sum of its proper divisors (1873820267).
12201100021 is a wasteful number, since it uses less digits than its factorization.
12201100021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6001 (or 5982 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 12201100021 its reverse (12000110221), we get a palindrome (24201210242).
The spelling of 12201100021 in words is "twelve billion, two hundred one million, one hundred thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •