Base | Representation |
---|---|
bin | 110101101111010110… |
… | …0101110101001011011 |
3 | 102000212210122121120121 |
4 | 1223132230232221123 |
5 | 3342322241321201 |
6 | 125003322334111 |
7 | 11223565600561 |
oct | 1533654565133 |
9 | 360783577517 |
10 | 115405417051 |
11 | 44a41392a31 |
12 | 1a44905a337 |
13 | ab62345932 |
14 | 582b059a31 |
15 | 30069329a1 |
hex | 1adeb2ea5b |
115405417051 has 2 divisors, whose sum is σ = 115405417052. Its totient is φ = 115405417050.
The previous prime is 115405416983. The next prime is 115405417069. The reversal of 115405417051 is 150714504511.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 115405417051 - 217 = 115405285979 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 115405416998 and 115405417016.
It is not a weakly prime, because it can be changed into another prime (115405417651) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 57702708525 + 57702708526.
It is an arithmetic number, because the mean of its divisors is an integer number (57702708526).
Almost surely, 2115405417051 is an apocalyptic number.
115405417051 is a deficient number, since it is larger than the sum of its proper divisors (1).
115405417051 is an equidigital number, since it uses as much as digits as its factorization.
115405417051 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 14000, while the sum is 34.
The spelling of 115405417051 in words is "one hundred fifteen billion, four hundred five million, four hundred seventeen thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •