Base | Representation |
---|---|
bin | 1011100111110101110… |
… | …0111001011111101101 |
3 | 201002101120101200221002 |
4 | 2321331130321133231 |
5 | 11232412321120044 |
6 | 231421214050045 |
7 | 20266042251551 |
oct | 2717534713755 |
9 | 632346350832 |
10 | 199673223149 |
11 | 77754368994 |
12 | 328461a9925 |
13 | 15aa17074aa |
14 | 994293b861 |
15 | 52d992674e |
hex | 2e7d7397ed |
199673223149 has 2 divisors, whose sum is σ = 199673223150. Its totient is φ = 199673223148.
The previous prime is 199673223119. The next prime is 199673223151. The reversal of 199673223149 is 941322376991.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 195536418025 + 4136805124 = 442195^2 + 64318^2 .
It is a cyclic number.
It is not a de Polignac number, because 199673223149 - 28 = 199673222893 is a prime.
It is a super-3 number, since 3×1996732231493 (a number of 35 digits) contains 333 as substring.
Together with 199673223151, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 199673223094 and 199673223103.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (199673223119) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 99836611574 + 99836611575.
It is an arithmetic number, because the mean of its divisors is an integer number (99836611575).
Almost surely, 2199673223149 is an apocalyptic number.
It is an amenable number.
199673223149 is a deficient number, since it is larger than the sum of its proper divisors (1).
199673223149 is an equidigital number, since it uses as much as digits as its factorization.
199673223149 is an evil number, because the sum of its binary digits is even.
The product of its digits is 4408992, while the sum is 56.
The spelling of 199673223149 in words is "one hundred ninety-nine billion, six hundred seventy-three million, two hundred twenty-three thousand, one hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •