Base | Representation |
---|---|
bin | 1011101000111111111… |
… | …0111011010111011101 |
3 | 201010012020102120212212 |
4 | 2322033332323113131 |
5 | 11234031414233342 |
6 | 231512122010205 |
7 | 20306536042163 |
oct | 2721776732735 |
9 | 633166376785 |
10 | 199984133597 |
11 | 778a3914576 |
12 | 32912346965 |
13 | 15b20c55381 |
14 | 9971d51233 |
15 | 5306d8d182 |
hex | 2e8ffbb5dd |
199984133597 has 2 divisors, whose sum is σ = 199984133598. Its totient is φ = 199984133596.
The previous prime is 199984133533. The next prime is 199984133599. The reversal of 199984133597 is 795331489991.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 185667053881 + 14317079716 = 430891^2 + 119654^2 .
It is a cyclic number.
It is not a de Polignac number, because 199984133597 - 26 = 199984133533 is a prime.
Together with 199984133599, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (199984133599) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 99992066798 + 99992066799.
It is an arithmetic number, because the mean of its divisors is an integer number (99992066799).
Almost surely, 2199984133597 is an apocalyptic number.
It is an amenable number.
199984133597 is a deficient number, since it is larger than the sum of its proper divisors (1).
199984133597 is an equidigital number, since it uses as much as digits as its factorization.
199984133597 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 66134880, while the sum is 68.
The spelling of 199984133597 in words is "one hundred ninety-nine billion, nine hundred eighty-four million, one hundred thirty-three thousand, five hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •