Base | Representation |
---|---|
bin | 11001000011101000111000… |
… | …000010010001110011101011 |
3 | 112110012010120212112202011210 |
4 | 121003220320002101303223 |
5 | 103421014040004031331 |
6 | 1030213423141524203 |
7 | 32132526512024106 |
oct | 3103507002216353 |
9 | 473163525482153 |
10 | 110201211002091 |
11 | 32128086742170 |
12 | 10439896713663 |
13 | 4964c11467801 |
14 | 1d2daa4bb773d |
15 | cb18be147446 |
hex | 643a38091ceb |
110201211002091 has 32 divisors (see below), whose sum is σ = 165558443821056. Its totient is φ = 64597015584000.
The previous prime is 110201211002089. The next prime is 110201211002219. The reversal of 110201211002091 is 190200112102011.
It is not a de Polignac number, because 110201211002091 - 21 = 110201211002089 is a prime.
It is not an unprimeable number, because it can be changed into a prime (110201211002011) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 29156226 + ... + 32718311.
It is an arithmetic number, because the mean of its divisors is an integer number (5173701369408).
Almost surely, 2110201211002091 is an apocalyptic number.
110201211002091 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
110201211002091 is a deficient number, since it is larger than the sum of its proper divisors (55357232818965).
110201211002091 is a wasteful number, since it uses less digits than its factorization.
110201211002091 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 61876323.
The product of its (nonzero) digits is 72, while the sum is 21.
The spelling of 110201211002091 in words is "one hundred ten trillion, two hundred one billion, two hundred eleven million, two thousand, ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •