Base | Representation |
---|---|
bin | 10110111111100001001110… |
… | …000101111100111001001011 |
3 | 111021001011121110021100200211 |
4 | 112333201032011330321023 |
5 | 101223240344132400021 |
6 | 555022451553341551 |
7 | 30204552633366526 |
oct | 2677411605747113 |
9 | 437034543240624 |
10 | 101122020200011 |
11 | 2a247676180378 |
12 | b41215bb678b7 |
13 | 44569c4cc6665 |
14 | 1ad84909d7bbd |
15 | ba563853e3e1 |
hex | 5bf84e17ce4b |
101122020200011 has 4 divisors (see below), whose sum is σ = 101129331472624. Its totient is φ = 101114708927400.
The previous prime is 101122020199957. The next prime is 101122020200083. The reversal of 101122020200011 is 110002020221101.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 101122020200011 - 231 = 101119872716363 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 101122020199964 and 101122020200000.
It is not an unprimeable number, because it can be changed into a prime (101122020200711) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3655615560 + ... + 3655643221.
It is an arithmetic number, because the mean of its divisors is an integer number (25282332868156).
Almost surely, 2101122020200011 is an apocalyptic number.
101122020200011 is a deficient number, since it is larger than the sum of its proper divisors (7311272613).
101122020200011 is an equidigital number, since it uses as much as digits as its factorization.
101122020200011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7311272612.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 101122020200011 its reverse (110002020221101), we get a palindrome (211124040421112).
The spelling of 101122020200011 in words is "one hundred one trillion, one hundred twenty-two billion, twenty million, two hundred thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •