Base | Representation |
---|---|
bin | 10100100111001011… |
… | …11000010001000000 |
3 | 1001120012211220011011 |
4 | 22103211320101000 |
5 | 140130411141021 |
6 | 5030025130304 |
7 | 541141266226 |
oct | 122345702100 |
9 | 31505756134 |
10 | 11066115136 |
11 | 47695960aa |
12 | 218a029994 |
13 | 1074835b2b |
14 | 76d9a0b16 |
15 | 44b79dde1 |
hex | 293978440 |
11066115136 has 28 divisors (see below), whose sum is σ = 22667691520. Its totient is φ = 5354570880.
The previous prime is 11066115119. The next prime is 11066115139. The reversal of 11066115136 is 63151166011.
It is a Harshad number since it is a multiple of its sum of digits (31).
It is a junction number, because it is equal to n+sod(n) for n = 11066115098 and 11066115107.
It is not an unprimeable number, because it can be changed into a prime (11066115139) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2786856 + ... + 2790823.
Almost surely, 211066115136 is an apocalyptic number.
11066115136 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
11066115136 is an abundant number, since it is smaller than the sum of its proper divisors (11601576384).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11066115136 is an equidigital number, since it uses as much as digits as its factorization.
11066115136 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5577722 (or 5577712 counting only the distinct ones).
The product of its (nonzero) digits is 3240, while the sum is 31.
The spelling of 11066115136 in words is "eleven billion, sixty-six million, one hundred fifteen thousand, one hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •