Base | Representation |
---|---|
bin | 10110101111011111110100… |
… | …001100000000101010011101 |
3 | 111010010220200110220210020001 |
4 | 112233133310030000222131 |
5 | 101102221002023223401 |
6 | 552421002502054301 |
7 | 30032164425036424 |
oct | 2657376414005235 |
9 | 433126613823201 |
10 | 100021000211101 |
11 | 29962739093642 |
12 | b2748a671a391 |
13 | 43a6c2ab02b68 |
14 | 1a9b083c9c2bb |
15 | b86b9825e601 |
hex | 5af7f4300a9d |
100021000211101 has 4 divisors (see below), whose sum is σ = 100024883190400. Its totient is φ = 100017117231804.
The previous prime is 100021000211063. The next prime is 100021000211113. The reversal of 100021000211101 is 101112000120001.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 100021000211101 - 213 = 100021000202909 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100021000211141) 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, 1941451011 + ... + 1941502528.
It is an arithmetic number, because the mean of its divisors is an integer number (25006220797600).
Almost surely, 2100021000211101 is an apocalyptic number.
It is an amenable number.
100021000211101 is a deficient number, since it is larger than the sum of its proper divisors (3882979299).
100021000211101 is an equidigital number, since it uses as much as digits as its factorization.
100021000211101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3882979298.
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 100021000211101 its reverse (101112000120001), we get a palindrome (201133000331102).
The spelling of 100021000211101 in words is "one hundred trillion, twenty-one billion, two hundred eleven thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •