Base | Representation |
---|---|
bin | 101110100100010010… |
… | …1110100010110001001 |
3 | 100120010022122002211212 |
4 | 1131020211310112021 |
5 | 3114301020333342 |
6 | 113535040302505 |
7 | 10140101001314 |
oct | 1351045642611 |
9 | 316108562755 |
10 | 100002121097 |
11 | 3945765477a |
12 | 1746a611a35 |
13 | 95790a3028 |
14 | 4ba945397b |
15 | 2904508182 |
hex | 1748974589 |
100002121097 has 4 divisors (see below), whose sum is σ = 100006186500. Its totient is φ = 99998055696.
The previous prime is 100002121033. The next prime is 100002121123. The reversal of 100002121097 is 790121200001.
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 67591680256 + 32410440841 = 259984^2 + 180029^2 .
It is a cyclic number.
It is not a de Polignac number, because 100002121097 - 26 = 100002121033 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (100002121027) 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, 1995578 + ... + 2045075.
It is an arithmetic number, because the mean of its divisors is an integer number (25001546625).
Almost surely, 2100002121097 is an apocalyptic number.
It is an amenable number.
100002121097 is a deficient number, since it is larger than the sum of its proper divisors (4065403).
100002121097 is an equidigital number, since it uses as much as digits as its factorization.
100002121097 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4065402.
The product of its (nonzero) digits is 252, while the sum is 23.
Adding to 100002121097 its reverse (790121200001), we get a palindrome (890123321098).
The spelling of 100002121097 in words is "one hundred billion, two million, one hundred twenty-one thousand, ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •