Base | Representation |
---|---|
bin | 10100101000001011… |
… | …10100001101101111 |
3 | 1001120210121020101210 |
4 | 22110011310031233 |
5 | 140140032042101 |
6 | 5030524405503 |
7 | 541302405360 |
oct | 122405641557 |
9 | 31523536353 |
10 | 11074487151 |
11 | 4773294122 |
12 | 21909a6893 |
13 | 10764a76a0 |
14 | 770b3db67 |
15 | 44c3a47d6 |
hex | 29417436f |
11074487151 has 64 divisors (see below), whose sum is σ = 19040731136. Its totient is φ = 5568393600.
The previous prime is 11074487147. The next prime is 11074487153. The reversal of 11074487151 is 15178447011.
11074487151 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 11074487151 - 22 = 11074487147 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (39).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11074487153) 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 63 ways as a sum of consecutive naturals, for example, 557256 + ... + 576786.
It is an arithmetic number, because the mean of its divisors is an integer number (297511424).
Almost surely, 211074487151 is an apocalyptic number.
11074487151 is a deficient number, since it is larger than the sum of its proper divisors (7966243985).
11074487151 is a wasteful number, since it uses less digits than its factorization.
11074487151 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19652.
The product of its (nonzero) digits is 31360, while the sum is 39.
The spelling of 11074487151 in words is "eleven billion, seventy-four million, four hundred eighty-seven thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •