Base | Representation |
---|---|
bin | 110101100011010001… |
… | …1011100111011011001 |
3 | 101222211120102011100022 |
4 | 1223012203130323121 |
5 | 3341010041110433 |
6 | 124455212120225 |
7 | 11210546456561 |
oct | 1530643347331 |
9 | 358746364308 |
10 | 115000331993 |
11 | 44853764598 |
12 | 1a355466075 |
13 | aac9443931 |
14 | 57cd32dda1 |
15 | 2ed10b7698 |
hex | 1ac68dced9 |
115000331993 has 2 divisors, whose sum is σ = 115000331994. Its totient is φ = 115000331992.
The previous prime is 115000331939. The next prime is 115000332043. The reversal of 115000331993 is 399133000511.
Together with previous prime (115000331939) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 107091253504 + 7909078489 = 327248^2 + 88933^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-115000331993 is a prime.
It is not a weakly prime, because it can be changed into another prime (115000331293) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 57500165996 + 57500165997.
It is an arithmetic number, because the mean of its divisors is an integer number (57500165997).
Almost surely, 2115000331993 is an apocalyptic number.
It is an amenable number.
115000331993 is a deficient number, since it is larger than the sum of its proper divisors (1).
115000331993 is an equidigital number, since it uses as much as digits as its factorization.
115000331993 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 10935, while the sum is 35.
The spelling of 115000331993 in words is "one hundred fifteen billion, three hundred thirty-one thousand, nine hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •