Base | Representation |
---|---|
bin | 101110100111010011… |
… | …0101101111001011001 |
3 | 100120101100111022021202 |
4 | 1131032212231321121 |
5 | 3120002333120441 |
6 | 113553043043545 |
7 | 10142434426466 |
oct | 1351646557131 |
9 | 316340438252 |
10 | 100103020121 |
11 | 394a95aa6a5 |
12 | 174983705b5 |
13 | 9593c6cab0 |
14 | 4bb89da66d |
15 | 290d2d919b |
hex | 174e9ade59 |
100103020121 has 4 divisors (see below), whose sum is σ = 107803252452. Its totient is φ = 92402787792.
The previous prime is 100103020103. The next prime is 100103020153. The reversal of 100103020121 is 121020301001.
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 6298644496 + 93804375625 = 79364^2 + 306275^2 .
It is a cyclic number.
It is not a de Polignac number, because 100103020121 - 210 = 100103019097 is a prime.
It is a super-2 number, since 2×1001030201212 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (100103020921) 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, 3850116146 + ... + 3850116171.
It is an arithmetic number, because the mean of its divisors is an integer number (26950813113).
Almost surely, 2100103020121 is an apocalyptic number.
It is an amenable number.
100103020121 is a deficient number, since it is larger than the sum of its proper divisors (7700232331).
100103020121 is an equidigital number, since it uses as much as digits as its factorization.
100103020121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7700232330.
The product of its (nonzero) digits is 12, while the sum is 11.
Adding to 100103020121 its reverse (121020301001), we get a palindrome (221123321122).
The spelling of 100103020121 in words is "one hundred billion, one hundred three million, twenty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •