Base | Representation |
---|---|
bin | 1011000110001101000011… |
… | …0010110011100100110101 |
3 | 1121012102110022101020110011 |
4 | 2301203100302303210311 |
5 | 3044401034241200041 |
6 | 41541054124500221 |
7 | 2366336234441635 |
oct | 261432062634465 |
9 | 47172408336404 |
10 | 12201210100021 |
11 | 3984560020068 |
12 | 14508146aa671 |
13 | 6a675262b477 |
14 | 30278269c6c5 |
15 | 1625ac727e81 |
hex | b18d0cb3935 |
12201210100021 has 8 divisors (see below), whose sum is σ = 12243085909184. Its totient is φ = 12159352726560.
The previous prime is 12201210099997. The next prime is 12201210100039. The reversal of 12201210100021 is 12000101210221.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 12201210100021 - 215 = 12201210067253 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 12201210099974 and 12201210100010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12201210100091) 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, 3282351 + ... + 5930956.
It is an arithmetic number, because the mean of its divisors is an integer number (1530385738648).
Almost surely, 212201210100021 is an apocalyptic number.
It is an amenable number.
12201210100021 is a deficient number, since it is larger than the sum of its proper divisors (41875809163).
12201210100021 is an equidigital number, since it uses as much as digits as its factorization.
12201210100021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9217851.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 12201210100021 its reverse (12000101210221), we get a palindrome (24201311310242).
The spelling of 12201210100021 in words is "twelve trillion, two hundred one billion, two hundred ten million, one hundred thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •