Base | Representation |
---|---|
bin | 10100100111001100… |
… | …11111010101010000 |
3 | 1001120020011000122200 |
4 | 22103212133111100 |
5 | 140130431301102 |
6 | 5030032403200 |
7 | 541142533602 |
oct | 122346372520 |
9 | 31506130580 |
10 | 11066275152 |
11 | 4769695349 |
12 | 218a0a6500 |
13 | 107489090a |
14 | 76da03172 |
15 | 44b7d151c |
hex | 29399f550 |
11066275152 has 60 divisors (see below), whose sum is σ = 30982240224. Its totient is φ = 3687324480.
The previous prime is 11066275151. The next prime is 11066275159. The reversal of 11066275152 is 25157266011.
11066275152 is a `hidden beast` number, since 1 + 10 + 6 + 627 + 5 + 15 + 2 = 666.
11066275152 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11066275151) 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 11 ways as a sum of consecutive naturals, for example, 395877 + ... + 422907.
Almost surely, 211066275152 is an apocalyptic number.
11066275152 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
11066275152 is an abundant number, since it is smaller than the sum of its proper divisors (19915965072).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11066275152 is a wasteful number, since it uses less digits than its factorization.
11066275152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 29888 (or 29879 counting only the distinct ones).
The product of its (nonzero) digits is 25200, while the sum is 36.
The spelling of 11066275152 in words is "eleven billion, sixty-six million, two hundred seventy-five thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •