Base | Representation |
---|---|
bin | 110101100111001101… |
… | …1000010001101011011 |
3 | 102000011202211000120201 |
4 | 1223032123002031123 |
5 | 3341242334440011 |
6 | 124520245403031 |
7 | 11214041524651 |
oct | 1531633021533 |
9 | 360152730521 |
10 | 115132343131 |
11 | 4491122a503 |
12 | 1a391709477 |
13 | ab1a8b4930 |
14 | 5802a94dd1 |
15 | 2edc991cc1 |
hex | 1ace6c235b |
115132343131 has 4 divisors (see below), whose sum is σ = 123988677232. Its totient is φ = 106276009032.
The previous prime is 115132343111. The next prime is 115132343177. The reversal of 115132343131 is 131343231511.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 115132343131 - 25 = 115132343099 is a prime.
It is a super-2 number, since 2×1151323431312 (a number of 23 digits) contains 22 as substring.
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 115132343131.
It is not an unprimeable number, because it can be changed into a prime (115132343101) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4428167031 + ... + 4428167056.
It is an arithmetic number, because the mean of its divisors is an integer number (30997169308).
Almost surely, 2115132343131 is an apocalyptic number.
115132343131 is a deficient number, since it is larger than the sum of its proper divisors (8856334101).
115132343131 is an equidigital number, since it uses as much as digits as its factorization.
115132343131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8856334100.
The product of its digits is 3240, while the sum is 28.
Adding to 115132343131 its reverse (131343231511), we get a palindrome (246475574642).
The spelling of 115132343131 in words is "one hundred fifteen billion, one hundred thirty-two million, three hundred forty-three thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •