Base | Representation |
---|---|
bin | 110101101100010101… |
… | …0010111101011110101 |
3 | 102000121202001222021211 |
4 | 1223120222113223311 |
5 | 3342120324313123 |
6 | 124545303441421 |
7 | 11221225660045 |
oct | 1533052275365 |
9 | 360552058254 |
10 | 115304135413 |
11 | 4499a1a65a5 |
12 | 1a41b156271 |
13 | ab4737397c |
14 | 581b813725 |
15 | 2eecac840d |
hex | 1ad8a97af5 |
115304135413 has 4 divisors (see below), whose sum is σ = 115321041568. Its totient is φ = 115287229260.
The previous prime is 115304135381. The next prime is 115304135447. The reversal of 115304135413 is 314531403511.
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, and also an emirpimes, since its reverse is a distinct semiprime: 314531403511 = 13 ⋅24194723347.
It is a cyclic number.
It is not a de Polignac number, because 115304135413 - 25 = 115304135381 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (115304139413) 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, 8442843 + ... + 8456488.
It is an arithmetic number, because the mean of its divisors is an integer number (28830260392).
Almost surely, 2115304135413 is an apocalyptic number.
It is an amenable number.
115304135413 is a deficient number, since it is larger than the sum of its proper divisors (16906155).
115304135413 is an equidigital number, since it uses as much as digits as its factorization.
115304135413 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 16906154.
The product of its (nonzero) digits is 10800, while the sum is 31.
Adding to 115304135413 its reverse (314531403511), we get a palindrome (429835538924).
The spelling of 115304135413 in words is "one hundred fifteen billion, three hundred four million, one hundred thirty-five thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •