Base | Representation |
---|---|
bin | 10111101110101… |
… | …10111000010011 |
3 | 111212120100101001 |
4 | 23313112320103 |
5 | 401424423021 |
6 | 31430322431 |
7 | 4634663542 |
oct | 1367267023 |
9 | 455510331 |
10 | 199061011 |
11 | a2401536 |
12 | 567b9417 |
13 | 32318aa6 |
14 | 1c61a159 |
15 | 12721091 |
hex | bdd6e13 |
199061011 has 2 divisors, whose sum is σ = 199061012. Its totient is φ = 199061010.
The previous prime is 199060969. The next prime is 199061029. The reversal of 199061011 is 110160991.
It is a strong prime.
It is an emirp because it is prime and its reverse (110160991) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 199061011 - 215 = 199028243 is a prime.
It is a super-2 number, since 2×1990610112 = 79250572200684242, which contains 22 as substring.
It is equal to p11029753 and since 199061011 and 11029753 have the same sum of digits, it is a Honaker prime.
It is not a weakly prime, because it can be changed into another prime (199061311) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 99530505 + 99530506.
It is an arithmetic number, because the mean of its divisors is an integer number (99530506).
Almost surely, 2199061011 is an apocalyptic number.
199061011 is a deficient number, since it is larger than the sum of its proper divisors (1).
199061011 is an equidigital number, since it uses as much as digits as its factorization.
199061011 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 486, while the sum is 28.
The square root of 199061011 is about 14108.8982915038. The cubic root of 199061011 is about 583.8869047824.
It can be divided in two parts, 1990 and 61011, that added together give a square (63001 = 2512).
The spelling of 199061011 in words is "one hundred ninety-nine million, sixty-one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •