Base | Representation |
---|---|
bin | 10110110000111100001100… |
… | …111101010000010000010011 |
3 | 111010111101201212212021000202 |
4 | 112300330030331100100103 |
5 | 101110332132201133021 |
6 | 552534330202205415 |
7 | 30042305614360262 |
oct | 2660741475202023 |
9 | 433441655767022 |
10 | 100120200021011 |
11 | 299a0813869015 |
12 | b28bb704b386b |
13 | 43b33a98c4031 |
14 | 1aa1bb49445d9 |
15 | b895520d5a0b |
hex | 5b0f0cf50413 |
100120200021011 has 8 divisors (see below), whose sum is σ = 101817480208560. Its totient is φ = 98422930755072.
The previous prime is 100120200020987. The next prime is 100120200021029. The reversal of 100120200021011 is 110120002021001.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-100120200021011 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 100120200020983 and 100120200021001.
It is not an unprimeable number, because it can be changed into a prime (100120200021031) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 16951811 + ... + 22081763.
It is an arithmetic number, because the mean of its divisors is an integer number (12727185026070).
Almost surely, 2100120200021011 is an apocalyptic number.
100120200021011 is a deficient number, since it is larger than the sum of its proper divisors (1697280187549).
100120200021011 is an equidigital number, since it uses as much as digits as its factorization.
100120200021011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5460805.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 100120200021011 its reverse (110120002021001), we get a palindrome (210240202042012).
The spelling of 100120200021011 in words is "one hundred trillion, one hundred twenty billion, two hundred million, twenty-one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •