Base | Representation |
---|---|
bin | 10110111101111001110101… |
… | …111101110010101111010011 |
3 | 111020122120002122210222010201 |
4 | 112331321311331302233103 |
5 | 101214431032110001321 |
6 | 554455453314040031 |
7 | 30163543145303626 |
oct | 2675716575625723 |
9 | 436576078728121 |
10 | 101011020000211 |
11 | 2a204595490362 |
12 | b3b4742279017 |
13 | 44493b551c669 |
14 | 1ad2d60a53dbd |
15 | ba27dd726291 |
hex | 5bde75f72bd3 |
101011020000211 has 4 divisors (see below), whose sum is σ = 103360113488632. Its totient is φ = 98661926511792.
The previous prime is 101011020000173. The next prime is 101011020000221. The reversal of 101011020000211 is 112000020110101.
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 101011020000211 - 29 = 101011019999699 is a prime.
It is a super-2 number, since 2×1010110200002112 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (101011020000221) 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, 1174546744146 + ... + 1174546744231.
It is an arithmetic number, because the mean of its divisors is an integer number (25840028372158).
Almost surely, 2101011020000211 is an apocalyptic number.
101011020000211 is a deficient number, since it is larger than the sum of its proper divisors (2349093488421).
101011020000211 is an equidigital number, since it uses as much as digits as its factorization.
101011020000211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2349093488420.
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 101011020000211 its reverse (112000020110101), we get a palindrome (213011040110312).
The spelling of 101011020000211 in words is "one hundred one trillion, eleven billion, twenty million, two hundred eleven", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •