Base | Representation |
---|---|
bin | 111101000011011000… |
… | …1010110000001110110 |
3 | 110112102021210020001202 |
4 | 1322012301112001312 |
5 | 4122003141213420 |
6 | 140121532252502 |
7 | 12321013320512 |
oct | 1720661260166 |
9 | 415367706052 |
10 | 131110101110 |
11 | 5067026356a |
12 | 214b0611132 |
13 | c495b810b1 |
14 | 64baab7142 |
15 | 3625542575 |
hex | 1e86c56076 |
131110101110 has 16 divisors (see below), whose sum is σ = 236192761296. Its totient is φ = 52400800608.
The previous prime is 131110101061. The next prime is 131110101121. The reversal of 131110101110 is 11101011131.
It is a super-2 number, since 2×1311101011102 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 131110101091 and 131110101100.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5392244 + ... + 5416503.
It is an arithmetic number, because the mean of its divisors is an integer number (14762047581).
Almost surely, 2131110101110 is an apocalyptic number.
131110101110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
131110101110 is a deficient number, since it is larger than the sum of its proper divisors (105082660186).
131110101110 is a wasteful number, since it uses less digits than its factorization.
131110101110 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10809967.
The product of its (nonzero) digits is 3, while the sum is 11.
Adding to 131110101110 its reverse (11101011131), we get a palindrome (142211112241).
The spelling of 131110101110 in words is "one hundred thirty-one billion, one hundred ten million, one hundred one thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •