Base | Representation |
---|---|
bin | 10110101111011111000100… |
… | …100111000111101001001011 |
3 | 111010010211121211222000211011 |
4 | 112233133010213013221023 |
5 | 101102212333203324321 |
6 | 552420351345544351 |
7 | 30032135563331146 |
oct | 2657370447075113 |
9 | 433124554860734 |
10 | 100020202011211 |
11 | 29962369572209 |
12 | b2747033450b7 |
13 | 43a6b31630431 |
14 | 1a9b009c8105d |
15 | b86b4d140ae1 |
hex | 5af7c49c7a4b |
100020202011211 has 8 divisors (see below), whose sum is σ = 100453615904304. Its totient is φ = 99586823525760.
The previous prime is 100020202011181. The next prime is 100020202011287. The reversal of 100020202011211 is 112110202020001.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 100020202011211 - 227 = 100020067793483 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 100020202011191 and 100020202011200.
It is not an unprimeable number, because it can be changed into a prime (100020202011511) 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, 3182181 + ... + 14497126.
It is an arithmetic number, because the mean of its divisors is an integer number (12556701988038).
Almost surely, 2100020202011211 is an apocalyptic number.
100020202011211 is a deficient number, since it is larger than the sum of its proper divisors (433413893093).
100020202011211 is a wasteful number, since it uses less digits than its factorization.
100020202011211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17703821.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 100020202011211 its reverse (112110202020001), we get a palindrome (212130404031212).
The spelling of 100020202011211 in words is "one hundred trillion, twenty billion, two hundred two million, eleven thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •