Base | Representation |
---|---|
bin | 1011000000011000000111… |
… | …0100111110001101110101 |
3 | 1120211212001112111001120110 |
4 | 2300012001310332031311 |
5 | 3041231023330120041 |
6 | 41423100303453233 |
7 | 2356163364342636 |
oct | 260060164761565 |
9 | 46755045431513 |
10 | 12101101020021 |
11 | 3946059061602 |
12 | 14353362b7219 |
13 | 69a18a349360 |
14 | 2db9a6d6588d |
15 | 15eb9db43516 |
hex | b0181d3e375 |
12101101020021 has 16 divisors (see below), whose sum is σ = 17670447385920. Its totient is φ = 7320613914240.
The previous prime is 12101101019981. The next prime is 12101101020049. The reversal of 12101101020021 is 12002010110121.
It is not a de Polignac number, because 12101101020021 - 213 = 12101101011829 is a prime.
It is a super-4 number, since 4×121011010200214 (a number of 53 digits) contains 4444 as substring.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 12101101019979 and 12101101020006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12101101020521) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2629528560 + ... + 2629533161.
It is an arithmetic number, because the mean of its divisors is an integer number (1104402961620).
Almost surely, 212101101020021 is an apocalyptic number.
It is an amenable number.
12101101020021 is a deficient number, since it is larger than the sum of its proper divisors (5569346365899).
12101101020021 is a wasteful number, since it uses less digits than its factorization.
12101101020021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5259061796.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 12101101020021 its reverse (12002010110121), we get a palindrome (24103111130142).
The spelling of 12101101020021 in words is "twelve trillion, one hundred one billion, one hundred one million, twenty thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •