Base | Representation |
---|---|
bin | 1101110010001… |
… | …10010000011011 |
3 | 22001120200002111 |
4 | 12321012100123 |
5 | 214100144011 |
6 | 15250213151 |
7 | 2602564000 |
oct | 671062033 |
9 | 261520074 |
10 | 115631131 |
11 | 5a2a8420 |
12 | 328841b7 |
13 | 1ac574b5 |
14 | 114dd8a7 |
15 | a241121 |
hex | 6e4641b |
115631131 has 32 divisors (see below), whose sum is σ = 154944000. Its totient is φ = 85307040.
The previous prime is 115631129. The next prime is 115631137. The reversal of 115631131 is 131136511.
It is not a de Polignac number, because 115631131 - 21 = 115631129 is a prime.
It is a super-3 number, since 3×1156311313 (a number of 25 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (115631137) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 70881 + ... + 72493.
It is an arithmetic number, because the mean of its divisors is an integer number (4842000).
Almost surely, 2115631131 is an apocalyptic number.
115631131 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
115631131 is a deficient number, since it is larger than the sum of its proper divisors (39312869).
115631131 is a wasteful number, since it uses less digits than its factorization.
115631131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1664 (or 1650 counting only the distinct ones).
The product of its digits is 270, while the sum is 22.
The square root of 115631131 is about 10753.1916657335. The cubic root of 115631131 is about 487.1824007163.
Adding to 115631131 its reverse (131136511), we get a palindrome (246767642).
The spelling of 115631131 in words is "one hundred fifteen million, six hundred thirty-one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •