Base | Representation |
---|---|
bin | 101110101010001110… |
… | …1010010010010001101 |
3 | 100120122012020220212202 |
4 | 1131110131102102031 |
5 | 3120203002223041 |
6 | 114010511411245 |
7 | 10145036145362 |
oct | 1352435222215 |
9 | 316565226782 |
10 | 100201211021 |
11 | 39549a759aa |
12 | 17505223b25 |
13 | 95ab3cc012 |
14 | 4bc7a7a469 |
15 | 2916c32a9b |
hex | 175475248d |
100201211021 has 4 divisors (see below), whose sum is σ = 101696751552. Its totient is φ = 98705670492.
The previous prime is 100201211009. The next prime is 100201211027. The reversal of 100201211021 is 120112102001.
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 a de Polignac number, because none of the positive numbers 2k-100201211021 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 100201210993 and 100201211011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100201211027) 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, 747770165 + ... + 747770298.
It is an arithmetic number, because the mean of its divisors is an integer number (25424187888).
Almost surely, 2100201211021 is an apocalyptic number.
It is an amenable number.
100201211021 is a deficient number, since it is larger than the sum of its proper divisors (1495540531).
100201211021 is an equidigital number, since it uses as much as digits as its factorization.
100201211021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1495540530.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 100201211021 its reverse (120112102001), we get a palindrome (220313313022).
The spelling of 100201211021 in words is "one hundred billion, two hundred one million, two hundred eleven thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •