Base | Representation |
---|---|
bin | 10101000101110110… |
… | …11011101011010001 |
3 | 1002020011000111210101 |
4 | 22202323123223101 |
5 | 141142244022231 |
6 | 5111340132401 |
7 | 550414340221 |
oct | 124273335321 |
9 | 32204014711 |
10 | 11323423441 |
11 | 48908606a0 |
12 | 2240237101 |
13 | 10b5c36b75 |
14 | 795c20081 |
15 | 464178661 |
hex | 2a2edbad1 |
11323423441 has 8 divisors (see below), whose sum is σ = 12615652224. Its totient is φ = 10074999120.
The previous prime is 11323423439. The next prime is 11323423469. The reversal of 11323423441 is 14432432311.
It is a happy number.
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 11323423441 - 21 = 11323423439 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11323420441) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 10950570 + ... + 10951603.
It is an arithmetic number, because the mean of its divisors is an integer number (1576956528).
Almost surely, 211323423441 is an apocalyptic number.
11323423441 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
11323423441 is a deficient number, since it is larger than the sum of its proper divisors (1292228783).
11323423441 is a wasteful number, since it uses less digits than its factorization.
11323423441 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21902231.
The product of its digits is 6912, while the sum is 28.
Adding to 11323423441 its reverse (14432432311), we get a palindrome (25755855752).
The spelling of 11323423441 in words is "eleven billion, three hundred twenty-three million, four hundred twenty-three thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •