Base | Representation |
---|---|
bin | 101110100100100011… |
… | …1110001011101111001 |
3 | 100120010221101022212101 |
4 | 1131021013301131321 |
5 | 3114310310202301 |
6 | 113535555143401 |
7 | 10140236443126 |
oct | 1351107613571 |
9 | 316127338771 |
10 | 100011022201 |
11 | 39461684262 |
12 | 174715a4b61 |
13 | 957ab9b65c |
14 | 4baa6cd74d |
15 | 29051b5701 |
hex | 17491f1779 |
100011022201 has 4 divisors (see below), whose sum is σ = 100011919504. Its totient is φ = 100010124900.
The previous prime is 100011022193. The next prime is 100011022211. The reversal of 100011022201 is 102220110001.
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, and also a brilliant number, because the two primes have the same length.
It is a cyclic number.
It is not a de Polignac number, because 100011022201 - 23 = 100011022193 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (100011022211) 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, 253035 + ... + 513856.
It is an arithmetic number, because the mean of its divisors is an integer number (25002979876).
Almost surely, 2100011022201 is an apocalyptic number.
It is an amenable number.
100011022201 is a deficient number, since it is larger than the sum of its proper divisors (897303).
100011022201 is an equidigital number, since it uses as much as digits as its factorization.
100011022201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 897302.
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 100011022201 its reverse (102220110001), we get a palindrome (202231132202).
It can be divided in two parts, 10001 and 1022201, that multiplied together give a palindrome (10223032201).
The spelling of 100011022201 in words is "one hundred billion, eleven million, twenty-two thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.226 sec. • engine limits •