Base | Representation |
---|---|
bin | 10000001100100101000… |
… | …000101101000001000101 |
3 | 10221101220002201210221222 |
4 | 100030211000231001011 |
5 | 121213424433033140 |
6 | 2211151351050125 |
7 | 143261416256114 |
oct | 20144500550105 |
9 | 3841802653858 |
10 | 1113017471045 |
11 | 39a034389727 |
12 | 15b863370945 |
13 | 80c5998626c |
14 | 3bc2829dc7b |
15 | 1de437045b5 |
hex | 1032502d045 |
1113017471045 has 8 divisors (see below), whose sum is σ = 1337896302624. Its totient is φ = 888897085264.
The previous prime is 1113017470987. The next prime is 1113017471047. The reversal of 1113017471045 is 5401747103111.
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 1113017471045 - 210 = 1113017470021 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1113017470996 and 1113017471014.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1113017471047) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 189608219 + ... + 189614088.
It is an arithmetic number, because the mean of its divisors is an integer number (167237037828).
Almost surely, 21113017471045 is an apocalyptic number.
It is an amenable number.
1113017471045 is a deficient number, since it is larger than the sum of its proper divisors (224878831579).
1113017471045 is an equidigital number, since it uses as much as digits as its factorization.
1113017471045 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 379222899.
The product of its (nonzero) digits is 11760, while the sum is 35.
The spelling of 1113017471045 in words is "one trillion, one hundred thirteen billion, seventeen million, four hundred seventy-one thousand, forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •