Base | Representation |
---|---|
bin | 11001000000110111101110… |
… | …100100111110010001101001 |
3 | 112102111221121202000210200210 |
4 | 121000313232210332101221 |
5 | 103404410012001201441 |
6 | 1025550204500251333 |
7 | 32113014064254102 |
oct | 3100675644762151 |
9 | 472457552023623 |
10 | 110011000022121 |
11 | 32064448593670 |
12 | 10408a513a0b49 |
13 | 494ccba205ba3 |
14 | 1d247bcc193a9 |
15 | cab98a2a8616 |
hex | 640dee93e469 |
110011000022121 has 16 divisors (see below), whose sum is σ = 160121900832768. Its totient is φ = 66629208013200.
The previous prime is 110011000022081. The next prime is 110011000022197. The reversal of 110011000022121 is 121220000110011.
It is not a de Polignac number, because 110011000022121 - 211 = 110011000020073 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 110011000022097 and 110011000022106.
It is not an unprimeable number, because it can be changed into a prime (110011000022221) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1103082721 + ... + 1103182446.
It is an arithmetic number, because the mean of its divisors is an integer number (10007618802048).
Almost surely, 2110011000022121 is an apocalyptic number.
110011000022121 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
110011000022121 is a deficient number, since it is larger than the sum of its proper divisors (50110900810647).
110011000022121 is a wasteful number, since it uses less digits than its factorization.
110011000022121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2206266692.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 110011000022121 its reverse (121220000110011), we get a palindrome (231231000132132).
The spelling of 110011000022121 in words is "one hundred ten trillion, eleven billion, twenty-two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •