Base | Representation |
---|---|
bin | 10100111100101111… |
… | …01010000001100011 |
3 | 1002000211002112222020 |
4 | 22132113222001203 |
5 | 141013203424123 |
6 | 5100004512523 |
7 | 545465244231 |
oct | 123627520143 |
9 | 32024075866 |
10 | 11246936163 |
11 | 4851669671 |
12 | 221a6ab743 |
13 | 10a3136618 |
14 | 7899cd951 |
15 | 45c5ba7e3 |
hex | 29e5ea063 |
11246936163 has 8 divisors (see below), whose sum is σ = 14997584976. Its totient is φ = 7497122400.
The previous prime is 11246936161. The next prime is 11246936201. The reversal of 11246936163 is 36163964211.
It is a happy number.
11246936163 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 not a de Polignac number, because 11246936163 - 21 = 11246936161 is a prime.
It is a Smith number, since the sum of its digits (42) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is not an unprimeable number, because it can be changed into a prime (11246936161) 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, 176628 + ... + 231713.
It is an arithmetic number, because the mean of its divisors is an integer number (1874698122).
Almost surely, 211246936163 is an apocalyptic number.
11246936163 is a deficient number, since it is larger than the sum of its proper divisors (3750648813).
11246936163 is an equidigital number, since it uses as much as digits as its factorization.
11246936163 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 417525.
The product of its digits is 139968, while the sum is 42.
The spelling of 11246936163 in words is "eleven billion, two hundred forty-six million, nine hundred thirty-six thousand, one hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •