Base | Representation |
---|---|
bin | 10101011000010010… |
… | …10010011010000100 |
3 | 1002121220222101011010 |
4 | 22230021102122010 |
5 | 142001340103221 |
6 | 5134542242220 |
7 | 554302550616 |
oct | 125411223204 |
9 | 32556871133 |
10 | 11478050436 |
11 | 49600731a6 |
12 | 2283b86370 |
13 | 110bc95b28 |
14 | 7ac590db6 |
15 | 472a1dc76 |
hex | 2ac252684 |
11478050436 has 12 divisors (see below), whose sum is σ = 26782117712. Its totient is φ = 3826016808.
The previous prime is 11478050431. The next prime is 11478050453. The reversal of 11478050436 is 63405087411.
It is a tau number, because it is divible by the number of its divisors (12).
It is a super-2 number, since 2×114780504362 (a number of 21 digits) contains 22 as substring.
It is a hoax number, since the sum of its digits (39) coincides with the sum of the digits of its distinct prime factors.
It is a junction number, because it is equal to n+sod(n) for n = 11478050394 and 11478050403.
It is not an unprimeable number, because it can be changed into a prime (11478050431) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 478252090 + ... + 478252113.
Almost surely, 211478050436 is an apocalyptic number.
It is an amenable number.
11478050436 is an abundant number, since it is smaller than the sum of its proper divisors (15304067276).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11478050436 is a wasteful number, since it uses less digits than its factorization.
11478050436 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 956504210 (or 956504208 counting only the distinct ones).
The product of its (nonzero) digits is 80640, while the sum is 39.
The spelling of 11478050436 in words is "eleven billion, four hundred seventy-eight million, fifty thousand, four hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •