Base | Representation |
---|---|
bin | 11001000000101101100101… |
… | …011110110111111010100110 |
3 | 112102110220111210112212111100 |
4 | 121000231211132313322212 |
5 | 103404220211130310042 |
6 | 1025541204121420530 |
7 | 32112150161552511 |
oct | 3100554536677246 |
9 | 472426453485440 |
10 | 110000110010022 |
11 | 3205a86a449371 |
12 | 1040691233a746 |
13 | 494bc7300b24b |
14 | 1d240687b9d78 |
15 | cab54e1e324c |
hex | 640b657b7ea6 |
110000110010022 has 48 divisors (see below), whose sum is σ = 242856882843120. Its totient is φ = 35970960033216.
The previous prime is 110000110009997. The next prime is 110000110010023. The reversal of 110000110010022 is 220010011000011.
It is a happy number.
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 = 110000110009986 and 110000110010013.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110000110010023) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 2489004 + ... + 15039792.
It is an arithmetic number, because the mean of its divisors is an integer number (5059518392565).
Almost surely, 2110000110010022 is an apocalyptic number.
110000110010022 is an abundant number, since it is smaller than the sum of its proper divisors (132856772833098).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110000110010022 is a wasteful number, since it uses less digits than its factorization.
110000110010022 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 12560037 (or 12560034 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 110000110010022 its reverse (220010011000011), we get a palindrome (330010121010033).
The spelling of 110000110010022 in words is "one hundred ten trillion, one hundred ten million, ten thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •