Base | Representation |
---|---|
bin | 110011010001010000… |
… | …1111111011110001001 |
3 | 101112012010110102020101 |
4 | 1212202201333132021 |
5 | 3300441324031441 |
6 | 122325114325401 |
7 | 10645256035165 |
oct | 1464241773611 |
9 | 345163412211 |
10 | 110101002121 |
11 | 4276a166540 |
12 | 19408729861 |
13 | a4c8401886 |
14 | 5486795ca5 |
15 | 2ce5de9231 |
hex | 19a287f789 |
110101002121 has 8 divisors (see below), whose sum is σ = 122079204288. Its totient is φ = 98450970000.
The previous prime is 110101002119. The next prime is 110101002127. The reversal of 110101002121 is 121200101011.
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 110101002121 - 21 = 110101002119 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 110101002098 and 110101002107.
It is not an unprimeable number, because it can be changed into a prime (110101002127) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 82041805 + ... + 82043146.
It is an arithmetic number, because the mean of its divisors is an integer number (15259900536).
Almost surely, 2110101002121 is an apocalyptic number.
110101002121 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
110101002121 is a deficient number, since it is larger than the sum of its proper divisors (11978202167).
110101002121 is a wasteful number, since it uses less digits than its factorization.
110101002121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 164085023.
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 110101002121 its reverse (121200101011), we get a palindrome (231301103132).
The spelling of 110101002121 in words is "one hundred ten billion, one hundred one million, two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •