Base | Representation |
---|---|
bin | 10000001001110111000… |
… | …111110100001110110110 |
3 | 10221010100210012000021100 |
4 | 100021313013310032312 |
5 | 121141441111200042 |
6 | 2205550053430530 |
7 | 143126213106204 |
oct | 20116707641666 |
9 | 3833323160240 |
10 | 1110100100022 |
11 | 3988776256a1 |
12 | 15b18a33b446 |
13 | 808b3442914 |
14 | 3ba2ca46074 |
15 | 1dd2253324c |
hex | 102771f43b6 |
1110100100022 has 48 divisors (see below), whose sum is σ = 2494205644320. Its totient is φ = 356536982016.
The previous prime is 1110100099981. The next prime is 1110100100063. The reversal of 1110100100022 is 2200010010111.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (1110100099981) and next prime (1110100100063).
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 1110100099977 and 1110100100013.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 8022747 + ... + 8159942.
It is an arithmetic number, because the mean of its divisors is an integer number (51962617590).
Almost surely, 21110100100022 is an apocalyptic number.
1110100100022 is an abundant number, since it is smaller than the sum of its proper divisors (1384105544298).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1110100100022 is a wasteful number, since it uses less digits than its factorization.
1110100100022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16182837 (or 16182834 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 1110100100022 its reverse (2200010010111), we get a palindrome (3310110110133).
The spelling of 1110100100022 in words is "one trillion, one hundred ten billion, one hundred million, one hundred thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •