Base | Representation |
---|---|
bin | 10100110000110111… |
… | …01010011110001001 |
3 | 1001202212122200202221 |
4 | 22120123222132021 |
5 | 140312203321043 |
6 | 5042045454041 |
7 | 543145453522 |
oct | 123033523611 |
9 | 31685580687 |
10 | 11147323273 |
11 | 4800411a69 |
12 | 21b1271321 |
13 | 10885ca098 |
14 | 77a69d849 |
15 | 4539908ed |
hex | 2986ea789 |
11147323273 has 8 divisors (see below), whose sum is σ = 11243860992. Its totient is φ = 11050922736.
The previous prime is 11147323241. The next prime is 11147323303. The reversal of 11147323273 is 37232374111.
11147323273 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 11147323273 - 25 = 11147323241 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11147323073) 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 7 ways as a sum of consecutive naturals, for example, 132411 + ... + 199567.
It is an arithmetic number, because the mean of its divisors is an integer number (1405482624).
Almost surely, 211147323273 is an apocalyptic number.
It is an amenable number.
11147323273 is a deficient number, since it is larger than the sum of its proper divisors (96537719).
11147323273 is a wasteful number, since it uses less digits than its factorization.
11147323273 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 68591.
The product of its digits is 21168, while the sum is 34.
Adding to 11147323273 its reverse (37232374111), we get a palindrome (48379697384).
The spelling of 11147323273 in words is "eleven billion, one hundred forty-seven million, three hundred twenty-three thousand, two hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •