Base | Representation |
---|---|
bin | 10000000001011111000… |
… | …010101001001100010111 |
3 | 10220021010222111022221000 |
4 | 100001133002221030113 |
5 | 121020031134000221 |
6 | 2201501410154343 |
7 | 142360302621030 |
oct | 20013702511427 |
9 | 3807128438830 |
10 | 1101106156311 |
11 | 394a817a0667 |
12 | 15949a2829b3 |
13 | 7caac003135 |
14 | 3b418369a87 |
15 | 1d997b50e26 |
hex | 1005f0a9317 |
1101106156311 has 16 divisors (see below), whose sum is σ = 1864306720000. Its totient is φ = 629203517784.
The previous prime is 1101106156243. The next prime is 1101106156327. The reversal of 1101106156311 is 1136516011011.
1101106156311 is a `hidden beast` number, since 1 + 1 + 0 + 1 + 10 + 6 + 15 + 631 + 1 = 666.
It is not a de Polignac number, because 1101106156311 - 223 = 1101097767703 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1101106156211) 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 15 ways as a sum of consecutive naturals, for example, 2912979061 + ... + 2912979438.
It is an arithmetic number, because the mean of its divisors is an integer number (116519170000).
Almost surely, 21101106156311 is an apocalyptic number.
1101106156311 is a deficient number, since it is larger than the sum of its proper divisors (763200563689).
1101106156311 is an equidigital number, since it uses as much as digits as its factorization.
1101106156311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5825958515 (or 5825958509 counting only the distinct ones).
The product of its (nonzero) digits is 540, while the sum is 27.
The spelling of 1101106156311 in words is "one trillion, one hundred one billion, one hundred six million, one hundred fifty-six thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •