Base | Representation |
---|---|
bin | 10100011111011011… |
… | …11001111111101001 |
3 | 1001101200112022120020 |
4 | 22033231321333221 |
5 | 140012241014010 |
6 | 5015343551053 |
7 | 536421616320 |
oct | 121755717751 |
9 | 31350468506 |
10 | 11001110505 |
11 | 4735927170 |
12 | 21702bb489 |
13 | 1064225c58 |
14 | 7650bd0b7 |
15 | 445c0d470 |
hex | 28fb79fe9 |
11001110505 has 64 divisors (see below), whose sum is σ = 21959424000. Its totient is φ = 4568901120.
The previous prime is 11001110503. The next prime is 11001110513. The reversal of 11001110505 is 50501110011.
It is not a de Polignac number, because 11001110505 - 21 = 11001110503 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is not an unprimeable number, because it can be changed into a prime (11001110503) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 3115581 + ... + 3119109.
It is an arithmetic number, because the mean of its divisors is an integer number (343116000).
Almost surely, 211001110505 is an apocalyptic number.
11001110505 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
11001110505 is a deficient number, since it is larger than the sum of its proper divisors (10958313495).
11001110505 is a wasteful number, since it uses less digits than its factorization.
11001110505 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6254.
The product of its (nonzero) digits is 25, while the sum is 15.
Adding to 11001110505 its reverse (50501110011), we get a palindrome (61502220516).
The spelling of 11001110505 in words is "eleven billion, one million, one hundred ten thousand, five hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •