Base | Representation |
---|---|
bin | 10110110010000111011110… |
… | …001101110110010111110111 |
3 | 111010210010100101022210210002 |
4 | 112302013132031312113313 |
5 | 101113143142134032134 |
6 | 553035414015421515 |
7 | 30051166455626252 |
oct | 2662073615662767 |
9 | 433703311283702 |
10 | 100201020220919 |
11 | 29a22017752462 |
12 | b2a3766b2489b |
13 | 43babb9932127 |
14 | 1aa5a805c6099 |
15 | b8b6d25bb87e |
hex | 5b21de3765f7 |
100201020220919 has 2 divisors, whose sum is σ = 100201020220920. Its totient is φ = 100201020220918.
The previous prime is 100201020220907. The next prime is 100201020220957. The reversal of 100201020220919 is 919022020102001.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 100201020220919 - 212 = 100201020216823 is a prime.
It is a super-2 number, since 2×1002010202209192 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 100201020220891 and 100201020220900.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (100201080220919) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50100510110459 + 50100510110460.
It is an arithmetic number, because the mean of its divisors is an integer number (50100510110460).
Almost surely, 2100201020220919 is an apocalyptic number.
100201020220919 is a deficient number, since it is larger than the sum of its proper divisors (1).
100201020220919 is an equidigital number, since it uses as much as digits as its factorization.
100201020220919 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1296, while the sum is 29.
The spelling of 100201020220919 in words is "one hundred trillion, two hundred one billion, twenty million, two hundred twenty thousand, nine hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •