Base | Representation |
---|---|
bin | 101100110000… |
… | …100010011011 |
3 | 211002002212000 |
4 | 230300202123 |
5 | 11000430042 |
6 | 1055252043 |
7 | 201505266 |
oct | 54604233 |
9 | 24062760 |
10 | 11733147 |
11 | 6694318 |
12 | 3b1a023 |
13 | 257a6ba |
14 | 17b5cdd |
15 | 106b74c |
hex | b3089b |
11733147 has 8 divisors (see below), whose sum is σ = 17382480. Its totient is φ = 7822080.
The previous prime is 11733143. The next prime is 11733157. The reversal of 11733147 is 74133711.
It is not a de Polignac number, because 11733147 - 22 = 11733143 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27), and also a Moran number because the ratio is a prime number: 434561 = 11733147 / (1 + 1 + 7 + 3 + 3 + 1 + 4 + 7).
It is a self number, because there is not a number n which added to its sum of digits gives 11733147.
It is not an unprimeable number, because it can be changed into a prime (11733143) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 217254 + ... + 217307.
It is an arithmetic number, because the mean of its divisors is an integer number (2172810).
Almost surely, 211733147 is an apocalyptic number.
11733147 is a deficient number, since it is larger than the sum of its proper divisors (5649333).
11733147 is an equidigital number, since it uses as much as digits as its factorization.
11733147 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 434570 (or 434564 counting only the distinct ones).
The product of its digits is 1764, while the sum is 27.
The square root of 11733147 is about 3425.3681553959. The cubic root of 11733147 is about 227.2330532298.
Adding to 11733147 its reverse (74133711), we get a palindrome (85866858).
The spelling of 11733147 in words is "eleven million, seven hundred thirty-three thousand, one hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •