Base | Representation |
---|---|
bin | 10110100010100011… |
… | …01100011001000011 |
3 | 1011020100012001102000 |
4 | 23101101230121003 |
5 | 144240324323021 |
6 | 5320434355043 |
7 | 605605616325 |
oct | 132121543103 |
9 | 34210161360 |
10 | 12101011011 |
11 | 514a783751 |
12 | 241872ba83 |
13 | 11ab07055b |
14 | 82b1d3615 |
15 | 4ac574b26 |
hex | 2d146c643 |
12101011011 has 16 divisors (see below), whose sum is σ = 18047748000. Its totient is φ = 8013194784.
The previous prime is 12101011003. The next prime is 12101011019. The reversal of 12101011011 is 11011010121.
It is an interprime number because it is at equal distance from previous prime (12101011003) and next prime (12101011019).
It is not a de Polignac number, because 12101011011 - 23 = 12101011003 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 12101010984 and 12101011002.
It is not an unprimeable number, because it can be changed into a prime (12101011019) 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, 1499956 + ... + 1508001.
It is an arithmetic number, because the mean of its divisors is an integer number (1127984250).
Almost surely, 212101011011 is an apocalyptic number.
12101011011 is a deficient number, since it is larger than the sum of its proper divisors (5946736989).
12101011011 is a wasteful number, since it uses less digits than its factorization.
12101011011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3008115 (or 3008109 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 12101011011 its reverse (11011010121), we get a palindrome (23112021132).
It can be divided in two parts, 121010110 and 11, that added together give a palindrome (121010121).
The spelling of 12101011011 in words is "twelve billion, one hundred one million, eleven thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •