Base | Representation |
---|---|
bin | 101101010001010101011001… |
… | …011101111010111111111011 |
3 | 222002222002102022022010221202 |
4 | 231101111121131322333323 |
5 | 202044102024242103411 |
6 | 1543242443203324415 |
7 | 56636511244566212 |
oct | 5521253135727773 |
9 | 862862368263852 |
10 | 199103299956731 |
11 | 58493265238925 |
12 | 1a3b767838070b |
13 | 871348c39b4c1 |
14 | 3724918a06079 |
15 | 180420160783b |
hex | b5155977affb |
199103299956731 has 2 divisors, whose sum is σ = 199103299956732. Its totient is φ = 199103299956730.
The previous prime is 199103299956721. The next prime is 199103299956761. The reversal of 199103299956731 is 137659992301991.
It is a weak prime.
It is an emirp because it is prime and its reverse (137659992301991) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 199103299956731 - 226 = 199103232847867 is a prime.
It is a super-2 number, since 2×1991032999567312 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (199103299956721) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 99551649978365 + 99551649978366.
It is an arithmetic number, because the mean of its divisors is an integer number (99551649978366).
Almost surely, 2199103299956731 is an apocalyptic number.
199103299956731 is a deficient number, since it is larger than the sum of its proper divisors (1).
199103299956731 is an equidigital number, since it uses as much as digits as its factorization.
199103299956731 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 223205220, while the sum is 74.
The spelling of 199103299956731 in words is "one hundred ninety-nine trillion, one hundred three billion, two hundred ninety-nine million, nine hundred fifty-six thousand, seven hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •