Base | Representation |
---|---|
bin | 10101000011100011… |
… | …10100000000010000 |
3 | 1002011210201000112021 |
4 | 22201301310000100 |
5 | 141122323440212 |
6 | 5105410341224 |
7 | 550061320666 |
oct | 124161640020 |
9 | 32153630467 |
10 | 11304124432 |
11 | 4880979aa7 |
12 | 223588a814 |
13 | 10b1c3a833 |
14 | 793438c36 |
15 | 462615307 |
hex | 2a1c74010 |
11304124432 has 40 divisors (see below), whose sum is σ = 23755713912. Its totient is φ = 5189836800.
The previous prime is 11304124399. The next prime is 11304124439. The reversal of 11304124432 is 23442140311.
It can be written as a sum of positive squares in 4 ways, for example, as 3358897936 + 7945226496 = 57956^2 + 89136^2 .
It is a super-3 number, since 3×113041244323 (a number of 31 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 11304124397 and 11304124406.
It is not an unprimeable number, because it can be changed into a prime (11304124439) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 495669 + ... + 517972.
Almost surely, 211304124432 is an apocalyptic number.
It is an amenable number.
11304124432 is an abundant number, since it is smaller than the sum of its proper divisors (12451589480).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11304124432 is a wasteful number, since it uses less digits than its factorization.
11304124432 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1013707 (or 1013701 counting only the distinct ones).
The product of its (nonzero) digits is 2304, while the sum is 25.
Adding to 11304124432 its reverse (23442140311), we get a palindrome (34746264743).
The spelling of 11304124432 in words is "eleven billion, three hundred four million, one hundred twenty-four thousand, four hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •