Base | Representation |
---|---|
bin | 10110101111010101101011… |
… | …001001000010101111110101 |
3 | 111010002212120120222120020201 |
4 | 112233111223021002233311 |
5 | 101102031201410120041 |
6 | 552412002153000501 |
7 | 30031330532324566 |
oct | 2657255311025765 |
9 | 433085516876221 |
10 | 100010111020021 |
11 | 2995906045a174 |
12 | b2727679b3131 |
13 | 43a5bb3b34b27 |
14 | 1a9a72d9d416d |
15 | b8675c2ac631 |
hex | 5af56b242bf5 |
100010111020021 has 4 divisors (see below), whose sum is σ = 100215470591392. Its totient is φ = 99804751448652.
The previous prime is 100010111020013. The next prime is 100010111020033. The reversal of 100010111020021 is 120020111010001.
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 100010111020021 - 23 = 100010111020013 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 (100010111020051) 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, 102679784955 + ... + 102679785928.
It is an arithmetic number, because the mean of its divisors is an integer number (25053867647848).
Almost surely, 2100010111020021 is an apocalyptic number.
It is an amenable number.
100010111020021 is a deficient number, since it is larger than the sum of its proper divisors (205359571371).
100010111020021 is an equidigital number, since it uses as much as digits as its factorization.
100010111020021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 205359571370.
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 100010111020021 its reverse (120020111010001), we get a palindrome (220030222030022).
The spelling of 100010111020021 in words is "one hundred trillion, ten billion, one hundred eleven million, twenty thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •