Base | Representation |
---|---|
bin | 1011000000011011100010… |
… | …0110101001000011011001 |
3 | 1120211221102120201121002210 |
4 | 2300012320212221003121 |
5 | 3041234414110311301 |
6 | 41423331412545333 |
7 | 2356225223543412 |
oct | 260067046510331 |
9 | 46757376647083 |
10 | 12102020010201 |
11 | 394648a884520 |
12 | 1435552022249 |
13 | 69a2a5861624 |
14 | 2dba53026809 |
15 | 15ec04671ad6 |
hex | b01b89a90d9 |
12102020010201 has 32 divisors (see below), whose sum is σ = 18073354844160. Its totient is φ = 7139365660800.
The previous prime is 12102020010163. The next prime is 12102020010203. The reversal of 12102020010201 is 10201002020121.
It is not a de Polignac number, because 12102020010201 - 215 = 12102019977433 is a prime.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (12102020010203) 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 31 ways as a sum of consecutive naturals, for example, 9593485 + ... + 10781418.
It is an arithmetic number, because the mean of its divisors is an integer number (564792338880).
Almost surely, 212102020010201 is an apocalyptic number.
12102020010201 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
12102020010201 is a deficient number, since it is larger than the sum of its proper divisors (5971334833959).
12102020010201 is a wasteful number, since it uses less digits than its factorization.
12102020010201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20375397.
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 12102020010201 its reverse (10201002020121), we get a palindrome (22303022030322).
The spelling of 12102020010201 in words is "twelve trillion, one hundred two billion, twenty million, ten thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •