Base | Representation |
---|---|
bin | 11001000010010100000001… |
… | …111111100100101010011010 |
3 | 112102212102102212221211211222 |
4 | 121002110001333210222122 |
5 | 103413021001130310020 |
6 | 1030103515231252042 |
7 | 32123123113253105 |
oct | 3102240177445232 |
9 | 472772385854758 |
10 | 110110110010010 |
11 | 320a2487599470 |
12 | 104240b107a022 |
13 | 4959453508136 |
14 | 1d2950199d73c |
15 | cae33b2dab25 |
hex | 642501fe4a9a |
110110110010010 has 256 divisors, whose sum is σ = 223567042318848. Its totient is φ = 38710204416000.
The previous prime is 110110110010009. The next prime is 110110110010027. The reversal of 110110110010010 is 10010011011011.
It is a self number, because there is not a number n which added to its sum of digits gives 110110110010010.
It is an unprimeable number.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 49222220612 + ... + 49222222848.
It is an arithmetic number, because the mean of its divisors is an integer number (873308759058).
Almost surely, 2110110110010010 is an apocalyptic number.
110110110010010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
110110110010010 is an abundant number, since it is smaller than the sum of its proper divisors (113456932308838).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110110110010010 is a wasteful number, since it uses less digits than its factorization.
110110110010010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3009.
The product of its (nonzero) digits is 1, while the sum is 8.
Adding to 110110110010010 its reverse (10010011011011), we get a palindrome (120120121021021).
It can be divided in two parts, 1101101 and 10010010, that added together give a palindrome (11111111).
The spelling of 110110110010010 in words is "one hundred ten trillion, one hundred ten billion, one hundred ten million, ten thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •