Base | Representation |
---|---|
bin | 1101101101100… |
… | …01000011100001 |
3 | 22000102121210001 |
4 | 12312301003201 |
5 | 213421120001 |
6 | 15225140001 |
7 | 2564440165 |
oct | 666610341 |
9 | 260377701 |
10 | 115020001 |
11 | 59a20258 |
12 | 3262a601 |
13 | 1aaa2295 |
14 | 113c0ca5 |
15 | a170001 |
hex | 6db10e1 |
115020001 has 2 divisors, whose sum is σ = 115020002. Its totient is φ = 115020000.
The previous prime is 115019959. The next prime is 115020019. The reversal of 115020001 is 100020511.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 76580001 + 38440000 = 8751^2 + 6200^2 .
It is an emirp because it is prime and its reverse (100020511) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 115020001 - 27 = 115019873 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 115020001.
It is not a weakly prime, because it can be changed into another prime (115023001) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 57510000 + 57510001.
It is an arithmetic number, because the mean of its divisors is an integer number (57510001).
Almost surely, 2115020001 is an apocalyptic number.
It is an amenable number.
115020001 is a deficient number, since it is larger than the sum of its proper divisors (1).
115020001 is an equidigital number, since it uses as much as digits as its factorization.
115020001 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 10, while the sum is 10.
The square root of 115020001 is about 10724.7378056529. The cubic root of 115020001 is about 486.3226038652.
Adding to 115020001 its reverse (100020511), we get a palindrome (215040512).
The spelling of 115020001 in words is "one hundred fifteen million, twenty thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •