Base | Representation |
---|---|
bin | 10101000110010111… |
… | …11000101001110110 |
3 | 1002020110010122010000 |
4 | 22203023320221312 |
5 | 141144400031223 |
6 | 5112012412130 |
7 | 550466112444 |
oct | 124313705166 |
9 | 32213118100 |
10 | 11327736438 |
11 | 4893237057 |
12 | 2241777046 |
13 | 10b6ab7035 |
14 | 796623b94 |
15 | 46472b543 |
hex | 2a32f8a76 |
11327736438 has 40 divisors (see below), whose sum is σ = 25394512968. Its totient is φ = 3774128256.
The previous prime is 11327736437. The next prime is 11327736439. The reversal of 11327736438 is 83463772311.
11327736438 is a `hidden beast` number, since 1 + 13 + 277 + 364 + 3 + 8 = 666.
It is an interprime number because it is at equal distance from previous prime (11327736437) and next prime (11327736439).
It is a super-2 number, since 2×113277364382 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 11327736393 and 11327736402.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11327736437) by changing a digit.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 352845 + ... + 383607.
Almost surely, 211327736438 is an apocalyptic number.
11327736438 is a gapful number since it is divisible by the number (18) formed by its first and last digit.
11327736438 is an abundant number, since it is smaller than the sum of its proper divisors (14066776530).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11327736438 is a wasteful number, since it uses less digits than its factorization.
11327736438 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 33050 (or 33041 counting only the distinct ones).
The product of its digits is 508032, while the sum is 45.
The spelling of 11327736438 in words is "eleven billion, three hundred twenty-seven million, seven hundred thirty-six thousand, four hundred thirty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •