Base | Representation |
---|---|
bin | 10110110000101001011111… |
… | …100100000110100001100001 |
3 | 111010102110212212000100002021 |
4 | 112300221133210012201201 |
5 | 101110020011420200001 |
6 | 552521204535021441 |
7 | 30040665032353405 |
oct | 2660513744064141 |
9 | 433373785010067 |
10 | 100100111100001 |
11 | 29993245125361 |
12 | b2880a480a881 |
13 | 43b152798461c |
14 | 1aa0c2a913105 |
15 | b88c78652ba1 |
hex | 5b0a5f906861 |
100100111100001 has 4 divisors (see below), whose sum is σ = 100194278656192. Its totient is φ = 100005943543812.
The previous prime is 100100111099993. The next prime is 100100111100023. The reversal of 100100111100001 is 100001111001001.
It is a happy number.
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 100100111100001 - 23 = 100100111099993 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (100100171100001) 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, 47083776501 + ... + 47083778626.
It is an arithmetic number, because the mean of its divisors is an integer number (25048569664048).
Almost surely, 2100100111100001 is an apocalyptic number.
It is an amenable number.
100100111100001 is a deficient number, since it is larger than the sum of its proper divisors (94167556191).
100100111100001 is an equidigital number, since it uses as much as digits as its factorization.
100100111100001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 94167556190.
The product of its (nonzero) digits is 1, while the sum is 7.
Adding to 100100111100001 its reverse (100001111001001), we get a palindrome (200101222101002).
The spelling of 100100111100001 in words is "one hundred trillion, one hundred billion, one hundred eleven million, one hundred thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •