Base | Representation |
---|---|
bin | 110011001110010000… |
… | …1001010100010100101 |
3 | 101111221002122011202101 |
4 | 1212130201022202211 |
5 | 3300240012401041 |
6 | 122311112212101 |
7 | 10642622416126 |
oct | 1463441124245 |
9 | 344832564671 |
10 | 110000122021 |
11 | 42718223859 |
12 | 1939a99a031 |
13 | a4b05405ca |
14 | 547721604d |
15 | 2cdc11db31 |
hex | 199c84a8a5 |
110000122021 has 8 divisors (see below), whose sum is σ = 116764101720. Its totient is φ = 103268740608.
The previous prime is 110000122009. The next prime is 110000122079. The reversal of 110000122021 is 120221000011.
It can be written as a sum of positive squares in 4 ways, for example, as 62244761121 + 47755360900 = 249489^2 + 218530^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 110000122021 - 27 = 110000121893 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 110000121989 and 110000122007.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110000122121) 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, 8142616 + ... + 8156113.
It is an arithmetic number, because the mean of its divisors is an integer number (14595512715).
Almost surely, 2110000122021 is an apocalyptic number.
It is an amenable number.
110000122021 is a deficient number, since it is larger than the sum of its proper divisors (6763979699).
110000122021 is a wasteful number, since it uses less digits than its factorization.
110000122021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 16299143.
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 110000122021 its reverse (120221000011), we get a palindrome (230221122032).
The spelling of 110000122021 in words is "one hundred ten billion, one hundred twenty-two thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •