Base | Representation |
---|---|
bin | 11001000010010000010000… |
… | …000000001111111100010011 |
3 | 112102212000221221112002201000 |
4 | 121002100100000033330103 |
5 | 103412434142311213021 |
6 | 1030102004321313043 |
7 | 32122620364511526 |
oct | 3102202000177423 |
9 | 472760857462630 |
10 | 110106050101011 |
11 | 320a0793906778 |
12 | 10423359495783 |
13 | 4958c5736c013 |
14 | 1d292386d2bbd |
15 | cae19eb7eb26 |
hex | 64241000ff13 |
110106050101011 has 8 divisors (see below), whose sum is σ = 163120074223760. Its totient is φ = 73404033400656.
The previous prime is 110106050100863. The next prime is 110106050101037. The reversal of 110106050101011 is 110101050601011.
It is a happy number.
110106050101011 is a `hidden beast` number, since 1 + 1 + 0 + 1 + 0 + 60 + 501 + 0 + 101 + 1 = 666.
It is not a de Polignac number, because 110106050101011 - 227 = 110105915883283 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (110106050101051) by changing a digit.
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, 2039000927770 + ... + 2039000927823.
It is an arithmetic number, because the mean of its divisors is an integer number (20390009277970).
Almost surely, 2110106050101011 is an apocalyptic number.
110106050101011 is a deficient number, since it is larger than the sum of its proper divisors (53014024122749).
110106050101011 is an equidigital number, since it uses as much as digits as its factorization.
110106050101011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4078001855602 (or 4078001855596 counting only the distinct ones).
The product of its (nonzero) digits is 30, while the sum is 18.
The spelling of 110106050101011 in words is "one hundred ten trillion, one hundred six billion, fifty million, one hundred one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •