Base | Representation |
---|---|
bin | 110011001110010100… |
… | …0110010110110010011 |
3 | 101111221020101210101112 |
4 | 1212130220302312103 |
5 | 3300241020402011 |
6 | 122311223123535 |
7 | 10642645416266 |
oct | 1463450626623 |
9 | 344836353345 |
10 | 110002122131 |
11 | 4271936a540 |
12 | 1939b5a35ab |
13 | a4b0a90ac5 |
14 | 54775b6cdd |
15 | 2cdc3b658b |
hex | 199ca32d93 |
110002122131 has 16 divisors (see below), whose sum is σ = 120719462400. Its totient is φ = 99405081600.
The previous prime is 110002122119. The next prime is 110002122161. The reversal of 110002122131 is 131221200011.
It is a de Polignac number, because none of the positive numbers 2k-110002122131 is a prime.
It is a super-2 number, since 2×1100021221312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (110002122161) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2941730 + ... + 2978888.
It is an arithmetic number, because the mean of its divisors is an integer number (7544966400).
Almost surely, 2110002122131 is an apocalyptic number.
110002122131 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
110002122131 is a deficient number, since it is larger than the sum of its proper divisors (10717340269).
110002122131 is a wasteful number, since it uses less digits than its factorization.
110002122131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 38770.
The product of its (nonzero) digits is 24, while the sum is 14.
Adding to 110002122131 its reverse (131221200011), we get a palindrome (241223322142).
The spelling of 110002122131 in words is "one hundred ten billion, two million, one hundred twenty-two thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •