Base | Representation |
---|---|
bin | 1001010001101110010111… |
… | …1000101011101001000111 |
3 | 1100010010021010222222021222 |
4 | 2110123211320223221013 |
5 | 2314104310423430431 |
6 | 33405510535430555 |
7 | 2101635133450412 |
oct | 224334570535107 |
9 | 40103233888258 |
10 | 10200109201991 |
11 | 32829298012a5 |
12 | 1188a23b2545b |
13 | 58cb34c90757 |
14 | 27398b918b79 |
15 | 12a4dcc8857b |
hex | 946e5e2ba47 |
10200109201991 has 2 divisors, whose sum is σ = 10200109201992. Its totient is φ = 10200109201990.
The previous prime is 10200109201973. The next prime is 10200109202027. The reversal of 10200109201991 is 19910290100201.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 10200109201991 - 230 = 10199035460167 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10200109201951) 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, 5100054600995 + 5100054600996.
It is an arithmetic number, because the mean of its divisors is an integer number (5100054600996).
Almost surely, 210200109201991 is an apocalyptic number.
10200109201991 is a deficient number, since it is larger than the sum of its proper divisors (1).
10200109201991 is an equidigital number, since it uses as much as digits as its factorization.
10200109201991 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2916, while the sum is 35.
The spelling of 10200109201991 in words is "ten trillion, two hundred billion, one hundred nine million, two hundred one thousand, nine hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •