Base | Representation |
---|---|
bin | 1011110011011… |
… | …01100101100101 |
3 | 20220022111001201 |
4 | 11321231211211 |
5 | 200321440023 |
6 | 13454122501 |
7 | 2311420336 |
oct | 571554545 |
9 | 226274051 |
10 | 99015013 |
11 | 50989499 |
12 | 291b0431 |
13 | 1768a386 |
14 | d21628d |
15 | 8a5cbad |
hex | 5e6d965 |
99015013 has 2 divisors, whose sum is σ = 99015014. Its totient is φ = 99015012.
The previous prime is 99015011. The next prime is 99015031. The reversal of 99015013 is 31051099.
Together with next prime (99015031) 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., 71115489 + 27899524 = 8433^2 + 5282^2 .
It is a cyclic number.
It is not a de Polignac number, because 99015013 - 21 = 99015011 is a prime.
Together with 99015011, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (99015011) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 49507506 + 49507507.
It is an arithmetic number, because the mean of its divisors is an integer number (49507507).
Almost surely, 299015013 is an apocalyptic number.
It is an amenable number.
99015013 is a deficient number, since it is larger than the sum of its proper divisors (1).
99015013 is an equidigital number, since it uses as much as digits as its factorization.
99015013 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1215, while the sum is 28.
The square root of 99015013 is about 9950.6287741027. The cubic root of 99015013 is about 462.6298839498.
The spelling of 99015013 in words is "ninety-nine million, fifteen thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •