Base | Representation |
---|---|
bin | 10110111110000010010011… |
… | …001100000000111000011011 |
3 | 111020200102112110211000100002 |
4 | 112332002103030000320123 |
5 | 101220103131122431021 |
6 | 554503554322203215 |
7 | 30164314153611314 |
oct | 2676022314007033 |
9 | 436612473730302 |
10 | 101020100202011 |
11 | 2a208424a80371 |
12 | b3b64571b350b |
13 | 444a2017a0b33 |
14 | 1ad358298560b |
15 | ba2b7099650b |
hex | 5be093300e1b |
101020100202011 has 2 divisors, whose sum is σ = 101020100202012. Its totient is φ = 101020100202010.
The previous prime is 101020100201989. The next prime is 101020100202031. The reversal of 101020100202011 is 110202001020101.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-101020100202011 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 101020100201983 and 101020100202001.
It is not a weakly prime, because it can be changed into another prime (101020100202031) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50510050101005 + 50510050101006.
It is an arithmetic number, because the mean of its divisors is an integer number (50510050101006).
Almost surely, 2101020100202011 is an apocalyptic number.
101020100202011 is a deficient number, since it is larger than the sum of its proper divisors (1).
101020100202011 is an equidigital number, since it uses as much as digits as its factorization.
101020100202011 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 101020100202011 its reverse (110202001020101), we get a palindrome (211222101222112).
The spelling of 101020100202011 in words is "one hundred one trillion, twenty billion, one hundred million, two hundred two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •