Base | Representation |
---|---|
bin | 1011000000011000111100… |
… | …0001001000010101100011 |
3 | 1120211212121221212210202001 |
4 | 2300012033001020111203 |
5 | 3041232002002423021 |
6 | 41423134250504431 |
7 | 2356202022314113 |
oct | 260061701102543 |
9 | 46755557783661 |
10 | 12101322311011 |
11 | 3946161a6681a |
12 | 1435398435117 |
13 | 69a1c414957b |
14 | 2db9c84cb043 |
15 | 15ebb32a6091 |
hex | b018f048563 |
12101322311011 has 16 divisors (see below), whose sum is σ = 12999397126464. Its totient is φ = 11224197264384.
The previous prime is 12101322310997. The next prime is 12101322311027. The reversal of 12101322311011 is 11011322310121.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-12101322311011 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 12101322311011.
It is not an unprimeable number, because it can be changed into a prime (12101322311411) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2514151 + ... + 5524816.
It is an arithmetic number, because the mean of its divisors is an integer number (812462320404).
Almost surely, 212101322311011 is an apocalyptic number.
12101322311011 is a deficient number, since it is larger than the sum of its proper divisors (898074815453).
12101322311011 is a wasteful number, since it uses less digits than its factorization.
12101322311011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8040270.
The product of its (nonzero) digits is 72, while the sum is 19.
Adding to 12101322311011 its reverse (11011322310121), we get a palindrome (23112644621132).
The spelling of 12101322311011 in words is "twelve trillion, one hundred one billion, three hundred twenty-two million, three hundred eleven thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •