Base | Representation |
---|---|
bin | 10111101110101… |
… | …01101010101111 |
3 | 111212120002120012 |
4 | 23313111222233 |
5 | 401424243142 |
6 | 31430243435 |
7 | 4634643221 |
oct | 1367255257 |
9 | 455502505 |
10 | 199056047 |
11 | a23a8833 |
12 | 567b657b |
13 | 32316758 |
14 | 1c618411 |
15 | 1271e882 |
hex | bdd5aaf |
199056047 has 2 divisors, whose sum is σ = 199056048. Its totient is φ = 199056046.
The previous prime is 199056031. The next prime is 199056079. The reversal of 199056047 is 740650991.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 199056047 - 24 = 199056031 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 199055995 and 199056013.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (199056947) 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, 99528023 + 99528024.
It is an arithmetic number, because the mean of its divisors is an integer number (99528024).
Almost surely, 2199056047 is an apocalyptic number.
199056047 is a deficient number, since it is larger than the sum of its proper divisors (1).
199056047 is an equidigital number, since it uses as much as digits as its factorization.
199056047 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 68040, while the sum is 41.
The square root of 199056047 is about 14108.7223730570. The cubic root of 199056047 is about 583.8820512643.
It can be divided in two parts, 19905 and 6047, that added together give a palindrome (25952).
The spelling of 199056047 in words is "one hundred ninety-nine million, fifty-six thousand, forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •