Base | Representation |
---|---|
bin | 110101100110100110… |
… | …1111101111001111101 |
3 | 102000010100210121122220 |
4 | 1223031031331321331 |
5 | 3341222201443123 |
6 | 124514244355553 |
7 | 11213405022624 |
oct | 1531515757175 |
9 | 360110717586 |
10 | 115112140413 |
11 | 44900890946 |
12 | 1a3869a5bb9 |
13 | ab1666016a |
14 | 58001166bb |
15 | 2edad00ce3 |
hex | 1acd37de7d |
115112140413 has 4 divisors (see below), whose sum is σ = 153482853888. Its totient is φ = 76741426940.
The previous prime is 115112140391. The next prime is 115112140417. The reversal of 115112140413 is 314041211511.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 115112140413 - 221 = 115110043261 is a prime.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (115112140417) 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, 19185356733 + ... + 19185356738.
It is an arithmetic number, because the mean of its divisors is an integer number (38370713472).
Almost surely, 2115112140413 is an apocalyptic number.
It is an amenable number.
115112140413 is a deficient number, since it is larger than the sum of its proper divisors (38370713475).
115112140413 is an equidigital number, since it uses as much as digits as its factorization.
115112140413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 38370713474.
The product of its (nonzero) digits is 480, while the sum is 24.
Adding to 115112140413 its reverse (314041211511), we get a palindrome (429153351924).
The spelling of 115112140413 in words is "one hundred fifteen billion, one hundred twelve million, one hundred forty thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •