Base | Representation |
---|---|
bin | 10100011111010100… |
… | …00110000011000101 |
3 | 1001101121122112220200 |
4 | 22033222012003011 |
5 | 140012012030201 |
6 | 5015310321113 |
7 | 536410255224 |
oct | 121752060305 |
9 | 31347575820 |
10 | 11000111301 |
11 | 4735304483 |
12 | 216bab9199 |
13 | 1063c661ca |
14 | 764cdccbb |
15 | 445ab2386 |
hex | 28fa860c5 |
11000111301 has 6 divisors (see below), whose sum is σ = 15889049670. Its totient is φ = 7333407528.
The previous prime is 11000111281. The next prime is 11000111303. The reversal of 11000111301 is 10311100011.
It can be written as a sum of positive squares in only one way, i.e., 7420961025 + 3579150276 = 86145^2 + 59826^2 .
It is not a de Polignac number, because 11000111301 - 29 = 11000110789 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9), and also a Moran number because the ratio is a prime number: 1222234589 = 11000111301 / (1 + 1 + 0 + 0 + 0 + 1 + 1 + 1 + 3 + 0 + 1).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11000111303) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 611117286 + ... + 611117303.
It is an arithmetic number, because the mean of its divisors is an integer number (2648174945).
Almost surely, 211000111301 is an apocalyptic number.
It is an amenable number.
11000111301 is a deficient number, since it is larger than the sum of its proper divisors (4888938369).
11000111301 is a wasteful number, since it uses less digits than its factorization.
11000111301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1222234595 (or 1222234592 counting only the distinct ones).
The product of its (nonzero) digits is 3, while the sum is 9.
Adding to 11000111301 its reverse (10311100011), we get a palindrome (21311211312).
The spelling of 11000111301 in words is "eleven billion, one hundred eleven thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •