Base | Representation |
---|---|
bin | 110101100011101000… |
… | …1010011010111100001 |
3 | 101222212102000210221122 |
4 | 1223013101103113201 |
5 | 3341021130221312 |
6 | 124500321502025 |
7 | 11211053600003 |
oct | 1530721232741 |
9 | 358772023848 |
10 | 115012351457 |
11 | 4485a523a33 |
12 | 1a3594a1915 |
13 | aacba91743 |
14 | 57d0b7c373 |
15 | 2ed218db72 |
hex | 1ac74535e1 |
115012351457 has 2 divisors, whose sum is σ = 115012351458. Its totient is φ = 115012351456.
The previous prime is 115012351291. The next prime is 115012351469. The reversal of 115012351457 is 754153210511.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 89640958801 + 25371392656 = 299401^2 + 159284^2 .
It is a cyclic number.
It is not a de Polignac number, because 115012351457 - 212 = 115012347361 is a prime.
It is not a weakly prime, because it can be changed into another prime (115012351757) 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 as a sum of consecutive naturals, namely, 57506175728 + 57506175729.
It is an arithmetic number, because the mean of its divisors is an integer number (57506175729).
Almost surely, 2115012351457 is an apocalyptic number.
It is an amenable number.
115012351457 is a deficient number, since it is larger than the sum of its proper divisors (1).
115012351457 is an equidigital number, since it uses as much as digits as its factorization.
115012351457 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 21000, while the sum is 35.
Adding to 115012351457 its reverse (754153210511), we get a palindrome (869165561968).
The spelling of 115012351457 in words is "one hundred fifteen billion, twelve million, three hundred fifty-one thousand, four hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •