Base | Representation |
---|---|
bin | 101110100100001111… |
… | …0000111011001110001 |
3 | 100120010011211112011112 |
4 | 1131020132013121301 |
5 | 3114300011231001 |
6 | 113534525123105 |
7 | 10140044561612 |
oct | 1351036073161 |
9 | 316104745145 |
10 | 100000102001 |
11 | 394564a57a8 |
12 | 174699b9495 |
13 | 9578846cb7 |
14 | 4ba9089c09 |
15 | 2904259cbb |
hex | 1748787671 |
100000102001 has 4 divisors (see below), whose sum is σ = 100004955252. Its totient is φ = 99995248752.
The previous prime is 100000101973. The next prime is 100000102009. The reversal of 100000102001 is 100201000001.
It is a happy number.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 72178195600 + 27821906401 = 268660^2 + 166799^2 .
It is a cyclic number.
It is not a de Polignac number, because 100000102001 - 230 = 98926360177 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (100000102009) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2395586 + ... + 2436971.
It is an arithmetic number, because the mean of its divisors is an integer number (25001238813).
Almost surely, 2100000102001 is an apocalyptic number.
It is an amenable number.
100000102001 is a deficient number, since it is larger than the sum of its proper divisors (4853251).
100000102001 is an equidigital number, since it uses as much as digits as its factorization.
100000102001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4853250.
The product of its (nonzero) digits is 2, while the sum is 5.
Adding to 100000102001 its reverse (100201000001), we get a palindrome (200201102002).
The spelling of 100000102001 in words is "one hundred billion, one hundred two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •