Base | Representation |
---|---|
bin | 10111110101100… |
… | …10001110101101 |
3 | 111221020222211021 |
4 | 23322302032231 |
5 | 402142200334 |
6 | 31501454141 |
7 | 4645425133 |
oct | 1372621655 |
9 | 457228737 |
10 | 199959469 |
11 | a2965566 |
12 | 56b71351 |
13 | 32571a18 |
14 | 1c7b1753 |
15 | 1284c3b4 |
hex | beb23ad |
199959469 has 2 divisors, whose sum is σ = 199959470. Its totient is φ = 199959468.
The previous prime is 199959467. The next prime is 199959499. The reversal of 199959469 is 964959991.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 141253225 + 58706244 = 11885^2 + 7662^2 .
It is an emirp because it is prime and its reverse (964959991) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 199959469 - 21 = 199959467 is a prime.
It is a super-2 number, since 2×1999594692 = 79967578485523922, which contains 22 as substring.
Together with 199959467, 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 (199959467) 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, 99979734 + 99979735.
It is an arithmetic number, because the mean of its divisors is an integer number (99979735).
Almost surely, 2199959469 is an apocalyptic number.
It is an amenable number.
199959469 is a deficient number, since it is larger than the sum of its proper divisors (1).
199959469 is an equidigital number, since it uses as much as digits as its factorization.
199959469 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 7085880, while the sum is 61.
The square root of 199959469 is about 14140.7025638757. The cubic root of 199959469 is about 584.7640405194.
The spelling of 199959469 in words is "one hundred ninety-nine million, nine hundred fifty-nine thousand, four hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •