Base | Representation |
---|---|
bin | 11001000010010100000001… |
… | …011101001111011010010010 |
3 | 112102212102102021000121020201 |
4 | 121002110001131033122102 |
5 | 103413020441324310231 |
6 | 1030103514310325414 |
7 | 32123122643620153 |
oct | 3102240135173222 |
9 | 472772367017221 |
10 | 110110101010066 |
11 | 320a24825016a3 |
12 | 104240aa05986a |
13 | 49594516a6821 |
14 | 1d295006d992a |
15 | cae33a60e161 |
hex | 64250174f692 |
110110101010066 has 32 divisors (see below), whose sum is σ = 184344639696000. Its totient is φ = 49020095331072.
The previous prime is 110110101009991. The next prime is 110110101010067. The reversal of 110110101010066 is 660010101011011.
It is a happy number.
110110101010066 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a super-3 number, since 3×1101101010100663 (a number of 43 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (19).
It is not an unprimeable number, because it can be changed into a prime (110110101010067) 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, 119745846 + ... + 120661873.
It is an arithmetic number, because the mean of its divisors is an integer number (5760769990500).
Almost surely, 2110110101010066 is an apocalyptic number.
110110101010066 is a deficient number, since it is larger than the sum of its proper divisors (74234538685934).
110110101010066 is a wasteful number, since it uses less digits than its factorization.
110110101010066 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 240408466.
The product of its (nonzero) digits is 36, while the sum is 19.
Adding to 110110101010066 its reverse (660010101011011), we get a palindrome (770120202021077).
The spelling of 110110101010066 in words is "one hundred ten trillion, one hundred ten billion, one hundred one million, ten thousand, sixty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •