Base | Representation |
---|---|
bin | 10100110000111100… |
… | …01000011101010111 |
3 | 1001202220212120110021 |
4 | 22120132020131113 |
5 | 140312340023031 |
6 | 5042111410011 |
7 | 543154120255 |
oct | 123036103527 |
9 | 31686776407 |
10 | 11147970391 |
11 | 4800814178 |
12 | 21b1523907 |
13 | 10887957ac |
14 | 77a7cb5d5 |
15 | 453a6c511 |
hex | 298788757 |
11147970391 has 2 divisors, whose sum is σ = 11147970392. Its totient is φ = 11147970390.
The previous prime is 11147970343. The next prime is 11147970521. The reversal of 11147970391 is 19307974111.
11147970391 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 11147970391 - 217 = 11147839319 is a prime.
It is a super-2 number, since 2×111479703912 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11147970331) 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 as a sum of consecutive naturals, namely, 5573985195 + 5573985196.
It is an arithmetic number, because the mean of its divisors is an integer number (5573985196).
Almost surely, 211147970391 is an apocalyptic number.
11147970391 is a deficient number, since it is larger than the sum of its proper divisors (1).
11147970391 is an equidigital number, since it uses as much as digits as its factorization.
11147970391 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 47628, while the sum is 43.
The spelling of 11147970391 in words is "eleven billion, one hundred forty-seven million, nine hundred seventy thousand, three hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •