Base | Representation |
---|---|
bin | 101101010000000001000111… |
… | …110100111110001101100101 |
3 | 222002122102211212220121200022 |
4 | 231100001013310332031211 |
5 | 202041111213240233401 |
6 | 1543133120031124525 |
7 | 56630125643221322 |
oct | 5520010764761545 |
9 | 862572755817608 |
10 | 199012809696101 |
11 | 58458949902765 |
12 | 1a3a2023373745 |
13 | 8707a9ab2419b |
14 | 37203b2969b49 |
15 | 1801ba71d871b |
hex | b50047d3e365 |
199012809696101 has 2 divisors, whose sum is σ = 199012809696102. Its totient is φ = 199012809696100.
The previous prime is 199012809696067. The next prime is 199012809696131. The reversal of 199012809696101 is 101696908210991.
It is a Cunningham number, because it is equal to 141071902+1.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 199012809696100 + 1 = 14107190^2 + 1^2 .
It is a cyclic number.
It is not a de Polignac number, because 199012809696101 - 230 = 199011735954277 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (199012809696131) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 99506404848050 + 99506404848051.
It is an arithmetic number, because the mean of its divisors is an integer number (99506404848051).
Almost surely, 2199012809696101 is an apocalyptic number.
It is an amenable number.
199012809696101 is a deficient number, since it is larger than the sum of its proper divisors (1).
199012809696101 is an equidigital number, since it uses as much as digits as its factorization.
199012809696101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3779136, while the sum is 62.
The spelling of 199012809696101 in words is "one hundred ninety-nine trillion, twelve billion, eight hundred nine million, six hundred ninety-six thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •