Base | Representation |
---|---|
bin | 10101000110011011… |
… | …10100001011111011 |
3 | 1002020111002100012100 |
4 | 22203031310023323 |
5 | 141200012224202 |
6 | 5112031314443 |
7 | 550503320565 |
oct | 124315641373 |
9 | 32214070170 |
10 | 11328242427 |
11 | 4893552227 |
12 | 224197ba23 |
13 | 10b6c33438 |
14 | 796716335 |
15 | 4647cb41c |
hex | 2a33742fb |
11328242427 has 6 divisors (see below), whose sum is σ = 16363016852. Its totient is φ = 7552161612.
The previous prime is 11328242413. The next prime is 11328242441. The reversal of 11328242427 is 72424282311.
11328242427 is a `hidden beast` number, since 1 + 132 + 82 + 424 + 27 = 666.
It is an interprime number because it is at equal distance from previous prime (11328242413) and next prime (11328242441).
It is not a de Polignac number, because 11328242427 - 210 = 11328241403 is a prime.
It is a super-3 number, since 3×113282424273 (a number of 31 digits) contains 333 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11328242391 and 11328242400.
It is not an unprimeable number, because it can be changed into a prime (11328242327) 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 5 ways as a sum of consecutive naturals, for example, 629346793 + ... + 629346810.
Almost surely, 211328242427 is an apocalyptic number.
11328242427 is a deficient number, since it is larger than the sum of its proper divisors (5034774425).
11328242427 is a wasteful number, since it uses less digits than its factorization.
11328242427 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1258693609 (or 1258693606 counting only the distinct ones).
The product of its digits is 43008, while the sum is 36.
The spelling of 11328242427 in words is "eleven billion, three hundred twenty-eight million, two hundred forty-two thousand, four hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •