Base | Representation |
---|---|
bin | 1010000001001000001110… |
… | …1011101100000111000111 |
3 | 1102222222100211011010002010 |
4 | 2200102003223230013013 |
5 | 2420430201341240421 |
6 | 35231554404545303 |
7 | 2214525466161312 |
oct | 240220353540707 |
9 | 42888324133063 |
10 | 11014505415111 |
11 | 3567253182a90 |
12 | 129a8276b2233 |
13 | 61b881662a13 |
14 | 2a1167c13979 |
15 | 1417a4d75076 |
hex | a0483aec1c7 |
11014505415111 has 16 divisors (see below), whose sum is σ = 16036790410368. Its totient is φ = 6668919650400.
The previous prime is 11014505415073. The next prime is 11014505415143. The reversal of 11014505415111 is 11151450541011.
It is not a de Polignac number, because 11014505415111 - 29 = 11014505414599 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11014505415191) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 163420221 + ... + 163487606.
It is an arithmetic number, because the mean of its divisors is an integer number (1002299400648).
Almost surely, 211014505415111 is an apocalyptic number.
11014505415111 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
11014505415111 is a deficient number, since it is larger than the sum of its proper divisors (5022284995257).
11014505415111 is a wasteful number, since it uses less digits than its factorization.
11014505415111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 326908862.
The product of its (nonzero) digits is 2000, while the sum is 30.
Adding to 11014505415111 its reverse (11151450541011), we get a palindrome (22165955956122).
The spelling of 11014505415111 in words is "eleven trillion, fourteen billion, five hundred five million, four hundred fifteen thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •