Base | Representation |
---|---|
bin | 100010000110101011101001… |
… | …0001101101111110010110001 |
3 | 1110100011100001111202212000102 |
4 | 1010031113102031233302301 |
5 | 303304430320001424423 |
6 | 2542003235544202145 |
7 | 120121144531252151 |
oct | 10415272215576261 |
9 | 1410140044685012 |
10 | 299985517608113 |
11 | 876481640a1107 |
12 | 2978b252a69355 |
13 | cb50688b9766c |
14 | 541153b26c761 |
15 | 24a34a21dec28 |
hex | 110d5d236fcb1 |
299985517608113 has 2 divisors, whose sum is σ = 299985517608114. Its totient is φ = 299985517608112.
The previous prime is 299985517608097. The next prime is 299985517608187. The reversal of 299985517608113 is 311806715589992.
It is an a-pointer prime, because the next prime (299985517608187) can be obtained adding 299985517608113 to its sum of digits (74).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 288413356011169 + 11572161596944 = 16982737^2 + 3401788^2 .
It is a cyclic number.
It is not a de Polignac number, because 299985517608113 - 24 = 299985517608097 is a prime.
It is not a weakly prime, because it can be changed into another prime (299985517608013) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 149992758804056 + 149992758804057.
It is an arithmetic number, because the mean of its divisors is an integer number (149992758804057).
Almost surely, 2299985517608113 is an apocalyptic number.
It is an amenable number.
299985517608113 is a deficient number, since it is larger than the sum of its proper divisors (1).
299985517608113 is an equidigital number, since it uses as much as digits as its factorization.
299985517608113 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 293932800, while the sum is 74.
The spelling of 299985517608113 in words is "two hundred ninety-nine trillion, nine hundred eighty-five billion, five hundred seventeen million, six hundred eight thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •