Base | Representation |
---|---|
bin | 10100101100100110… |
… | …00101011100101101 |
3 | 1001200101021200222110 |
4 | 22112103011130231 |
5 | 140224022120140 |
6 | 5034330234233 |
7 | 542232235113 |
oct | 122623053455 |
9 | 31611250873 |
10 | 11111520045 |
11 | 479218851a |
12 | 21a1285979 |
13 | 1081072842 |
14 | 775a1dab3 |
15 | 45076c380 |
hex | 2964c572d |
11111520045 has 8 divisors (see below), whose sum is σ = 17778432096. Its totient is φ = 5926144016.
The previous prime is 11111520037. The next prime is 11111520047. The reversal of 11111520045 is 54002511111.
11111520045 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 a cyclic number.
It is not a de Polignac number, because 11111520045 - 23 = 11111520037 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11111520047) 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 7 ways as a sum of consecutive naturals, for example, 370383987 + ... + 370384016.
It is an arithmetic number, because the mean of its divisors is an integer number (2222304012).
Almost surely, 211111520045 is an apocalyptic number.
11111520045 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
11111520045 is a deficient number, since it is larger than the sum of its proper divisors (6666912051).
11111520045 is an equidigital number, since it uses as much as digits as its factorization.
11111520045 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 740768011.
The product of its (nonzero) digits is 200, while the sum is 21.
The spelling of 11111520045 in words is "eleven billion, one hundred eleven million, five hundred twenty thousand, forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •