Base | Representation |
---|---|
bin | 110011001110010000… |
… | …0110001101000110110 |
3 | 101111221002102222211122 |
4 | 1212130200301220312 |
5 | 3300240001120042 |
6 | 122311110103542 |
7 | 10642621512554 |
oct | 1463440615066 |
9 | 344832388748 |
10 | 110000020022 |
11 | 42718164162 |
12 | 1939a94abb2 |
13 | a4b0506059 |
14 | 54771cabd4 |
15 | 2cdc0ed7d2 |
hex | 199c831a36 |
110000020022 has 16 divisors (see below), whose sum is σ = 174449384640. Its totient is φ = 51875729928.
The previous prime is 110000019959. The next prime is 110000020051. The reversal of 110000020022 is 220020000011.
It is a junction number, because it is equal to n+sod(n) for n = 110000019991 and 110000020009.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 6367448 + ... + 6384699.
It is an arithmetic number, because the mean of its divisors is an integer number (10903086540).
Almost surely, 2110000020022 is an apocalyptic number.
110000020022 is a deficient number, since it is larger than the sum of its proper divisors (64449364618).
110000020022 is a wasteful number, since it uses less digits than its factorization.
110000020022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12752395.
The product of its (nonzero) digits is 8, while the sum is 8.
Adding to 110000020022 its reverse (220020000011), we get a palindrome (330020020033).
The spelling of 110000020022 in words is "one hundred ten billion, twenty thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •