Base | Representation |
---|---|
bin | 111101000011011000… |
… | …1010110000001110001 |
3 | 110112102021210020001120 |
4 | 1322012301112001301 |
5 | 4122003141213410 |
6 | 140121532252453 |
7 | 12321013320504 |
oct | 1720661260161 |
9 | 415367706046 |
10 | 131110101105 |
11 | 50670263565 |
12 | 214b0611129 |
13 | c495b810a9 |
14 | 64baab713b |
15 | 3625542570 |
hex | 1e86c56071 |
131110101105 has 16 divisors (see below), whose sum is σ = 209794838400. Its totient is φ = 69919161728.
The previous prime is 131110101061. The next prime is 131110101121. The reversal of 131110101105 is 501101011131.
It is a cyclic number.
It is not a de Polignac number, because 131110101105 - 29 = 131110100593 is a prime.
It is a super-2 number, since 2×1311101011052 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is an unprimeable number.
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, 212412 + ... + 554381.
It is an arithmetic number, because the mean of its divisors is an integer number (13112177400).
Almost surely, 2131110101105 is an apocalyptic number.
131110101105 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
131110101105 is a deficient number, since it is larger than the sum of its proper divisors (78684737295).
131110101105 is a wasteful number, since it uses less digits than its factorization.
131110101105 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 778200.
The product of its (nonzero) digits is 15, while the sum is 15.
Adding to 131110101105 its reverse (501101011131), we get a palindrome (632211112236).
The spelling of 131110101105 in words is "one hundred thirty-one billion, one hundred ten million, one hundred one thousand, one hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •