Base | Representation |
---|---|
bin | 101111000101010100… |
… | …0000111100000011001 |
3 | 100122222112100012121001 |
4 | 1132022220013200121 |
5 | 3124033131120441 |
6 | 114241014345001 |
7 | 10206412663525 |
oct | 1361250074031 |
9 | 318875305531 |
10 | 101110020121 |
11 | 39975a74700 |
12 | 1771965b161 |
13 | 96c478b196 |
14 | 4c7264ad85 |
15 | 296b8ee731 |
hex | 178aa07819 |
101110020121 has 6 divisors (see below), whose sum is σ = 111137460266. Its totient is φ = 91918200000.
The previous prime is 101110020073. The next prime is 101110020197. The reversal of 101110020121 is 121020011101.
It can be written as a sum of positive squares in only one way, i.e., 100021020121 + 1089000000 = 316261^2 + 33000^2 .
It is not a de Polignac number, because 101110020121 - 215 = 101109987353 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 101110020098 and 101110020107.
It is not an unprimeable number, because it can be changed into a prime (101110020821) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 417809880 + ... + 417810121.
Almost surely, 2101110020121 is an apocalyptic number.
101110020121 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
101110020121 is a deficient number, since it is larger than the sum of its proper divisors (10027440145).
101110020121 is an equidigital number, since it uses as much as digits as its factorization.
101110020121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 835620023 (or 835620012 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 101110020121 its reverse (121020011101), we get a palindrome (222130031222).
The spelling of 101110020121 in words is "one hundred one billion, one hundred ten million, twenty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •