Base | Representation |
---|---|
bin | 10100110000110101… |
… | …10111000000101111 |
3 | 1001202212020222122100 |
4 | 22120122313000233 |
5 | 140312130044440 |
6 | 5042041150143 |
7 | 543143615151 |
oct | 123032670057 |
9 | 31685228570 |
10 | 11147112495 |
11 | 4800288672 |
12 | 21b118b353 |
13 | 108855516c |
14 | 77a646ad1 |
15 | 45394d230 |
hex | 2986b702f |
11147112495 has 48 divisors (see below), whose sum is σ = 20388438720. Its totient is φ = 5622701568.
The previous prime is 11147112443. The next prime is 11147112499. The reversal of 11147112495 is 59421174111.
11147112495 is a `hidden beast` number, since 1 + 11 + 47 + 112 + 495 = 666.
11147112495 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 11147112495 - 28 = 11147112239 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11147112499) 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 47 ways as a sum of consecutive naturals, for example, 31609 + ... + 152621.
It is an arithmetic number, because the mean of its divisors is an integer number (424759140).
Almost surely, 211147112495 is an apocalyptic number.
11147112495 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
11147112495 is a deficient number, since it is larger than the sum of its proper divisors (9241326225).
11147112495 is a wasteful number, since it uses less digits than its factorization.
11147112495 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 121136 (or 121133 counting only the distinct ones).
The product of its digits is 10080, while the sum is 36.
The spelling of 11147112495 in words is "eleven billion, one hundred forty-seven million, one hundred twelve thousand, four hundred ninety-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •