Base | Representation |
---|---|
bin | 1011100110011110110… |
… | …0101000001100101001 |
3 | 201001110010122000221101 |
4 | 2321213230220030221 |
5 | 11231140402412344 |
6 | 231321055241401 |
7 | 20254021103614 |
oct | 2714754501451 |
9 | 631403560841 |
10 | 199308247849 |
11 | 77587345607 |
12 | 32763b19261 |
13 | 15a43c09c89 |
14 | 990a29317b |
15 | 52b78809d4 |
hex | 2e67b28329 |
199308247849 has 2 divisors, whose sum is σ = 199308247850. Its totient is φ = 199308247848.
The previous prime is 199308247847. The next prime is 199308247861. The reversal of 199308247849 is 948742803991.
199308247849 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 189426893824 + 9881354025 = 435232^2 + 99405^2 .
It is a cyclic number.
It is not a de Polignac number, because 199308247849 - 21 = 199308247847 is a prime.
Together with 199308247847, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (199308247847) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 99654123924 + 99654123925.
It is an arithmetic number, because the mean of its divisors is an integer number (99654123925).
Almost surely, 2199308247849 is an apocalyptic number.
It is an amenable number.
199308247849 is a deficient number, since it is larger than the sum of its proper divisors (1).
199308247849 is an equidigital number, since it uses as much as digits as its factorization.
199308247849 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 31352832, while the sum is 64.
The spelling of 199308247849 in words is "one hundred ninety-nine billion, three hundred eight million, two hundred forty-seven thousand, eight hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •