Base | Representation |
---|---|
bin | 110011010001110111… |
… | …0010100001111001001 |
3 | 101112020112002221001102 |
4 | 1212203232110033021 |
5 | 3301011434310441 |
6 | 122331111231145 |
7 | 10645621066433 |
oct | 1464356241711 |
9 | 345215087042 |
10 | 110121010121 |
11 | 4277a491881 |
12 | 194133784b5 |
13 | a4cc5b8825 |
14 | 54892c3653 |
15 | 2ce7a4c69b |
hex | 19a3b943c9 |
110121010121 has 8 divisors (see below), whose sum is σ = 112330355784. Its totient is φ = 107924699520.
The previous prime is 110121010093. The next prime is 110121010127. The reversal of 110121010121 is 121010121011.
It can be written as a sum of positive squares in 4 ways, for example, as 8321088400 + 101799921721 = 91220^2 + 319061^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 110121010121 - 214 = 110120993737 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (110121010127) 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 7 ways as a sum of consecutive naturals, for example, 3241700 + ... + 3275493.
It is an arithmetic number, because the mean of its divisors is an integer number (14041294473).
Almost surely, 2110121010121 is an apocalyptic number.
It is an amenable number.
110121010121 is a deficient number, since it is larger than the sum of its proper divisors (2209345663).
110121010121 is an equidigital number, since it uses as much as digits as its factorization.
110121010121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6517531.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 110121010121 its reverse (121010121011), we get a palindrome (231131131132).
The spelling of 110121010121 in words is "one hundred ten billion, one hundred twenty-one million, ten thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •