Base | Representation |
---|---|
bin | 111101000001001000… |
… | …0010011011111110111 |
3 | 110112020000012201012002 |
4 | 1322002100103133313 |
5 | 4121324242044002 |
6 | 140110224245515 |
7 | 12316103303000 |
oct | 1720220233767 |
9 | 415200181162 |
10 | 131034331127 |
11 | 50631511447 |
12 | 2148b17089b |
13 | c48327219b |
14 | 64b09d21a7 |
15 | 361da77002 |
hex | 1e824137f7 |
131034331127 has 32 divisors (see below), whose sum is σ = 162048067200. Its totient is φ = 105545341440.
The previous prime is 131034331049. The next prime is 131034331147. The reversal of 131034331127 is 721133430131.
It is a happy number.
It is not a de Polignac number, because 131034331127 - 212 = 131034327031 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 131034331127.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (131034331147) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 3837293 + ... + 3871289.
It is an arithmetic number, because the mean of its divisors is an integer number (5064002100).
Almost surely, 2131034331127 is an apocalyptic number.
131034331127 is a gapful number since it is divisible by the number (17) formed by its first and last digit.
131034331127 is a deficient number, since it is larger than the sum of its proper divisors (31013736073).
131034331127 is an equidigital number, since it uses as much as digits as its factorization.
131034331127 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 34696 (or 34682 counting only the distinct ones).
The product of its (nonzero) digits is 4536, while the sum is 29.
Adding to 131034331127 its reverse (721133430131), we get a palindrome (852167761258).
The spelling of 131034331127 in words is "one hundred thirty-one billion, thirty-four million, three hundred thirty-one thousand, one hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •