Base | Representation |
---|---|
bin | 1010001001110011000110… |
… | …1111001011101100010001 |
3 | 1110112012211100001022002021 |
4 | 2202130301233023230101 |
5 | 2430400223320021140 |
6 | 35424230431451441 |
7 | 2231350544133511 |
oct | 242346157135421 |
9 | 43465740038067 |
10 | 11163454454545 |
11 | 3614438010988 |
12 | 1303676386b81 |
13 | 62c92b271603 |
14 | 2a8457b8d841 |
15 | 1455c1558b4a |
hex | a2731bcbb11 |
11163454454545 has 8 divisors (see below), whose sum is σ = 13396320509760. Its totient is φ = 8930646787440.
The previous prime is 11163454454543. The next prime is 11163454454557. The reversal of 11163454454545 is 54545445436111.
11163454454545 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 11163454454545 - 21 = 11163454454543 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11163454454492 and 11163454454501.
It is not an unprimeable number, because it can be changed into a prime (11163454454543) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 14175291 + ... + 14942080.
It is an arithmetic number, because the mean of its divisors is an integer number (1674540063720).
Almost surely, 211163454454545 is an apocalyptic number.
It is an amenable number.
11163454454545 is a deficient number, since it is larger than the sum of its proper divisors (2232866055215).
11163454454545 is an equidigital number, since it uses as much as digits as its factorization.
11163454454545 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 29194055.
The product of its digits is 11520000, while the sum is 52.
The spelling of 11163454454545 in words is "eleven trillion, one hundred sixty-three billion, four hundred fifty-four million, four hundred fifty-four thousand, five hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •