Base | Representation |
---|---|
bin | 1101101111000… |
… | …00111000101001 |
3 | 22000210120112001 |
4 | 12313200320221 |
5 | 213443402123 |
6 | 15233251001 |
7 | 2566214311 |
oct | 667407051 |
9 | 260716461 |
10 | 115215913 |
11 | 5a04446a |
12 | 32703a61 |
13 | 1ab404c7 |
14 | 11432441 |
15 | a1ad0ad |
hex | 6de0e29 |
115215913 has 2 divisors, whose sum is σ = 115215914. Its totient is φ = 115215912.
The previous prime is 115215899. The next prime is 115215931. The reversal of 115215913 is 319512511.
Together with next prime (115215931) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 93760489 + 21455424 = 9683^2 + 4632^2 .
It is an emirp because it is prime and its reverse (319512511) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-115215913 is a prime.
It is not a weakly prime, because it can be changed into another prime (115215013) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 57607956 + 57607957.
It is an arithmetic number, because the mean of its divisors is an integer number (57607957).
Almost surely, 2115215913 is an apocalyptic number.
It is an amenable number.
115215913 is a deficient number, since it is larger than the sum of its proper divisors (1).
115215913 is an equidigital number, since it uses as much as digits as its factorization.
115215913 is an evil number, because the sum of its binary digits is even.
The product of its digits is 1350, while the sum is 28.
The square root of 115215913 is about 10733.8675695203. The cubic root of 115215913 is about 486.5985627996.
The spelling of 115215913 in words is "one hundred fifteen million, two hundred fifteen thousand, nine hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •