Base | Representation |
---|---|
bin | 11001000010001100011110… |
… | …101010001100010101100110 |
3 | 112102211122111202102222002002 |
4 | 121002030132222030111212 |
5 | 103412402344224310042 |
6 | 1030100054435245302 |
7 | 32122415140014530 |
oct | 3102143652142546 |
9 | 472748452388062 |
10 | 110102001010022 |
11 | 32099aa624278a |
12 | 10422609449832 |
13 | 495876051cba8 |
14 | 1d28d72a40850 |
15 | cae01445e132 |
hex | 64231ea8c566 |
110102001010022 has 32 divisors (see below), whose sum is σ = 189123183720000. Its totient is φ = 47092353758208.
The previous prime is 110102001009983. The next prime is 110102001010031. The reversal of 110102001010022 is 220010100201011.
It is a super-3 number, since 3×1101020010100223 (a number of 43 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 110102001009985 and 110102001010012.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 237441854 + ... + 237905102.
It is an arithmetic number, because the mean of its divisors is an integer number (5910099491250).
Almost surely, 2110102001010022 is an apocalyptic number.
110102001010022 is a deficient number, since it is larger than the sum of its proper divisors (79021182709978).
110102001010022 is a wasteful number, since it uses less digits than its factorization.
110102001010022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 497120.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 110102001010022 its reverse (220010100201011), we get a palindrome (330112101211033).
The spelling of 110102001010022 in words is "one hundred ten trillion, one hundred two billion, one million, ten thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •