Base | Representation |
---|---|
bin | 101110100111110101… |
… | …1101110011000000101 |
3 | 100120102121112100222001 |
4 | 1131033223232120011 |
5 | 3120022001010041 |
6 | 113554530505301 |
7 | 10143044251642 |
oct | 1351753563005 |
9 | 316377470861 |
10 | 100121110021 |
11 | 39508835929 |
12 | 174a2435231 |
13 | 959793498a |
14 | 4bbb188dc9 |
15 | 290ebae131 |
hex | 174faee605 |
100121110021 has 4 divisors (see below), whose sum is σ = 100143608544. Its totient is φ = 100098611500.
The previous prime is 100121109973. The next prime is 100121110027. The reversal of 100121110021 is 120011121001.
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: 120011121001 = 661 ⋅181559941.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-100121110021 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100121110027) 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, 11242585 + ... + 11251486.
It is an arithmetic number, because the mean of its divisors is an integer number (25035902136).
Almost surely, 2100121110021 is an apocalyptic number.
It is an amenable number.
100121110021 is a deficient number, since it is larger than the sum of its proper divisors (22498523).
100121110021 is an equidigital number, since it uses as much as digits as its factorization.
100121110021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22498522.
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 100121110021 its reverse (120011121001), we get a palindrome (220132231022).
The spelling of 100121110021 in words is "one hundred billion, one hundred twenty-one million, one hundred ten thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •