Base | Representation |
---|---|
bin | 1011111011110… |
… | …11010111000001 |
3 | 20222101121211012 |
4 | 11331323113001 |
5 | 201112320001 |
6 | 13533530305 |
7 | 2324002022 |
oct | 575732701 |
9 | 228347735 |
10 | 100120001 |
11 | 51573703 |
12 | 29643995 |
13 | 17986307 |
14 | d422c49 |
15 | 8bca2bb |
hex | 5f7b5c1 |
100120001 has 4 divisors (see below), whose sum is σ = 100184832. Its totient is φ = 100055172.
The previous prime is 100119997. The next prime is 100120003. The reversal of 100120001 is 100021001.
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, and also an emirpimes, since its reverse is a distinct semiprime: 100021001 = 4969 ⋅20129.
It is a cyclic number.
It is not a de Polignac number, because 100120001 - 22 = 100119997 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (100120003) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 30041 + ... + 33206.
It is an arithmetic number, because the mean of its divisors is an integer number (25046208).
Almost surely, 2100120001 is an apocalyptic number.
It is an amenable number.
100120001 is a deficient number, since it is larger than the sum of its proper divisors (64831).
100120001 is an equidigital number, since it uses as much as digits as its factorization.
100120001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 64830.
The product of its (nonzero) digits is 2, while the sum is 5.
The square root of 100120001 is about 10005.9982510492. The cubic root of 100120001 is about 464.3444742446.
Adding to 100120001 its reverse (100021001), we get a palindrome (200141002).
The spelling of 100120001 in words is "one hundred million, one hundred twenty thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.023 sec. • engine limits •