Base | Representation |
---|---|
bin | 10000000110000011100… |
… | …001101100111011110011 |
3 | 10220201210222001021100212 |
4 | 100012003201230323303 |
5 | 121110103342321141 |
6 | 2204032342134335 |
7 | 142623016316402 |
oct | 20060341547363 |
9 | 3821728037325 |
10 | 1106013245171 |
11 | 39706a7090aa |
12 | 15a4297213ab |
13 | 803b1830a03 |
14 | 3b761d63639 |
15 | 1db838532eb |
hex | 1018386cef3 |
1106013245171 has 4 divisors (see below), whose sum is σ = 1106058319344. Its totient is φ = 1105968171000.
The previous prime is 1106013245147. The next prime is 1106013245191. The reversal of 1106013245171 is 1715423106011.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 1106013245171 - 238 = 831135338227 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1106013245191) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 22500260 + ... + 22549361.
It is an arithmetic number, because the mean of its divisors is an integer number (276514579836).
Almost surely, 21106013245171 is an apocalyptic number.
1106013245171 is a deficient number, since it is larger than the sum of its proper divisors (45074173).
1106013245171 is an equidigital number, since it uses as much as digits as its factorization.
1106013245171 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 45074172.
The product of its (nonzero) digits is 5040, while the sum is 32.
The spelling of 1106013245171 in words is "one trillion, one hundred six billion, thirteen million, two hundred forty-five thousand, one hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •