Base | Representation |
---|---|
bin | 10000000001011001011… |
… | …100010001100111101001 |
3 | 10220020220102201110211112 |
4 | 100001121130101213221 |
5 | 121014333111242301 |
6 | 2201444212440105 |
7 | 142355052250346 |
oct | 20013134214751 |
9 | 3806812643745 |
10 | 1101012212201 |
11 | 394a33766000 |
12 | 159472919035 |
13 | 7ca956ccbc5 |
14 | 3b409ab37cd |
15 | 1d98e7959bb |
hex | 100597119e9 |
1101012212201 has 16 divisors (see below), whose sum is σ = 1213458360000. Its totient is φ = 998913738240.
The previous prime is 1101012212143. The next prime is 1101012212207. The reversal of 1101012212201 is 1022122101011.
It is not a de Polignac number, because 1101012212201 - 230 = 1099938470377 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1101012212207) 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, 164696 + ... + 1493033.
It is an arithmetic number, because the mean of its divisors is an integer number (75841147500).
Almost surely, 21101012212201 is an apocalyptic number.
1101012212201 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1101012212201 is a deficient number, since it is larger than the sum of its proper divisors (112446147799).
1101012212201 is an equidigital number, since it uses as much as digits as its factorization.
1101012212201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1658261 (or 1658239 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 1101012212201 its reverse (1022122101011), we get a palindrome (2123134313212).
The spelling of 1101012212201 in words is "one trillion, one hundred one billion, twelve million, two hundred twelve thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •