Base | Representation |
---|---|
bin | 10000001010110101011… |
… | …110011100101000001101 |
3 | 10221020001200122102011101 |
4 | 100022311132130220031 |
5 | 121201111413020140 |
6 | 2210241543423101 |
7 | 143164145014621 |
oct | 20126536345015 |
9 | 3836050572141 |
10 | 1111146220045 |
11 | 39926408a0a4 |
12 | 15b420754a91 |
13 | 80a1c0aa154 |
14 | 3bacb95b181 |
15 | 1dd842c499a |
hex | 102b579ca0d |
1111146220045 has 8 divisors (see below), whose sum is σ = 1343874484224. Its totient is φ = 881917629264.
The previous prime is 1111146220033. The next prime is 1111146220049. The reversal of 1111146220045 is 5400226411111.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1111146220045 - 213 = 1111146211853 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1111146219995 and 1111146220022.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1111146220049) 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 7 ways as a sum of consecutive naturals, for example, 874917649 + ... + 874918918.
It is an arithmetic number, because the mean of its divisors is an integer number (167984310528).
Almost surely, 21111146220045 is an apocalyptic number.
It is an amenable number.
1111146220045 is a deficient number, since it is larger than the sum of its proper divisors (232728264179).
1111146220045 is a wasteful number, since it uses less digits than its factorization.
1111146220045 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1749836699.
The product of its (nonzero) digits is 1920, while the sum is 28.
The spelling of 1111146220045 in words is "one trillion, one hundred eleven billion, one hundred forty-six million, two hundred twenty thousand, forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •