Base | Representation |
---|---|
bin | 11001000000111000110110… |
… | …101100101011010011001101 |
3 | 112102112001202001211002211002 |
4 | 121000320312230223103031 |
5 | 103404420001230013401 |
6 | 1025550524522310045 |
7 | 32113056056023442 |
oct | 3100706654532315 |
9 | 472461661732732 |
10 | 110012210001101 |
11 | 32064a095957a1 |
12 | 1040912a658325 |
13 | 4950150ab2495 |
14 | 1d248957c59c9 |
15 | caba0b615a6b |
hex | 640e36b2b4cd |
110012210001101 has 24 divisors (see below), whose sum is σ = 116981972070720. Its totient is φ = 103436567764992.
The previous prime is 110012210001073. The next prime is 110012210001167. The reversal of 110012210001101 is 101100012210011.
It is not a de Polignac number, because 110012210001101 - 226 = 110012142892237 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110012210001901) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 2925293240 + ... + 2925330846.
It is an arithmetic number, because the mean of its divisors is an integer number (4874248836280).
Almost surely, 2110012210001101 is an apocalyptic number.
It is an amenable number.
110012210001101 is a deficient number, since it is larger than the sum of its proper divisors (6969762069619).
110012210001101 is a wasteful number, since it uses less digits than its factorization.
110012210001101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 47573 (or 47556 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 110012210001101 its reverse (101100012210011), we get a palindrome (211112222211112).
The spelling of 110012210001101 in words is "one hundred ten trillion, twelve billion, two hundred ten million, one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •