Base | Representation |
---|---|
bin | 1101101101101… |
… | …00101111111011 |
3 | 22000110101112102 |
4 | 12312310233323 |
5 | 213422111011 |
6 | 15225334015 |
7 | 2564532251 |
oct | 666645773 |
9 | 260411472 |
10 | 115035131 |
11 | 59a30662 |
12 | 3263730b |
13 | 1aaa9133 |
14 | 113c65d1 |
15 | a17473b |
hex | 6db4bfb |
115035131 has 4 divisors (see below), whose sum is σ = 115741032. Its totient is φ = 114329232.
The previous prime is 115035127. The next prime is 115035157. The reversal of 115035131 is 131530511.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 131530511 = 7 ⋅18790073.
It is a cyclic number.
It is not a de Polignac number, because 115035131 - 22 = 115035127 is a prime.
It is a super-2 number, since 2×1150351312 = 26466162728374322, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (115035031) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 352706 + ... + 353031.
It is an arithmetic number, because the mean of its divisors is an integer number (28935258).
Almost surely, 2115035131 is an apocalyptic number.
115035131 is a deficient number, since it is larger than the sum of its proper divisors (705901).
115035131 is an equidigital number, since it uses as much as digits as its factorization.
115035131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 705900.
The product of its (nonzero) digits is 225, while the sum is 20.
The square root of 115035131 is about 10725.4431610074. The cubic root of 115035131 is about 486.3439269346.
Adding to 115035131 its reverse (131530511), we get a palindrome (246565642).
The spelling of 115035131 in words is "one hundred fifteen million, thirty-five thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •