Base | Representation |
---|---|
bin | 101101101110011001000100… |
… | …001110010000100101001101 |
3 | 222101000222111222010010100102 |
4 | 231232121010032100211031 |
5 | 202324311002422300213 |
6 | 1551412040113340445 |
7 | 60234001013261264 |
oct | 5556310416204515 |
9 | 871028458103312 |
10 | 201100103321933 |
11 | 59093090724672 |
12 | 1a67a669867725 |
13 | 88298735a199a |
14 | 3793422b055db |
15 | 183b11db4e158 |
hex | b6e64439094d |
201100103321933 has 2 divisors, whose sum is σ = 201100103321934. Its totient is φ = 201100103321932.
The previous prime is 201100103321893. The next prime is 201100103321951. The reversal of 201100103321933 is 339123301001102.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 161708939889289 + 39391163432644 = 12716483^2 + 6276238^2 .
It is a cyclic number.
It is not a de Polignac number, because 201100103321933 - 228 = 201099834886477 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 201100103321896 and 201100103321905.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (201100103321983) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100550051660966 + 100550051660967.
It is an arithmetic number, because the mean of its divisors is an integer number (100550051660967).
Almost surely, 2201100103321933 is an apocalyptic number.
It is an amenable number.
201100103321933 is a deficient number, since it is larger than the sum of its proper divisors (1).
201100103321933 is an equidigital number, since it uses as much as digits as its factorization.
201100103321933 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2916, while the sum is 29.
The spelling of 201100103321933 in words is "two hundred one trillion, one hundred billion, one hundred three million, three hundred twenty-one thousand, nine hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •