Base | Representation |
---|---|
bin | 10100100101011000… |
… | …10001101110011011 |
3 | 1001112011102201202100 |
4 | 22102230101232123 |
5 | 140113024440232 |
6 | 5024325334443 |
7 | 540566035551 |
oct | 122254215633 |
9 | 31464381670 |
10 | 11051015067 |
11 | 4761012204 |
12 | 2184b67423 |
13 | 1071679a91 |
14 | 76b98dbd1 |
15 | 44a2b9c7c |
hex | 292b11b9b |
11051015067 has 24 divisors (see below), whose sum is σ = 16582517120. Its totient is φ = 7084247040.
The previous prime is 11051015021. The next prime is 11051015077. The reversal of 11051015067 is 76051015011.
It is a happy number.
11051015067 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 11051015067 - 27 = 11051014939 is a prime.
It is a super-2 number, since 2×110510150672 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 11051015067.
It is not an unprimeable number, because it can be changed into a prime (11051015077) 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 23 ways as a sum of consecutive naturals, for example, 82342 + ... + 169947.
Almost surely, 211051015067 is an apocalyptic number.
11051015067 is a deficient number, since it is larger than the sum of its proper divisors (5531502053).
11051015067 is a wasteful number, since it uses less digits than its factorization.
11051015067 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 252483 (or 252480 counting only the distinct ones).
The product of its (nonzero) digits is 1050, while the sum is 27.
The spelling of 11051015067 in words is "eleven billion, fifty-one million, fifteen thousand, sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •