Base | Representation |
---|---|
bin | 10101100001000000… |
… | …11110111101101000 |
3 | 1002211000200210102012 |
4 | 22300200132331220 |
5 | 142124104140130 |
6 | 5150115055052 |
7 | 556151630444 |
oct | 126040367550 |
9 | 32730623365 |
10 | 11551240040 |
11 | 499841267a |
12 | 22a45a1488 |
13 | 11211b03a2 |
14 | 7b81a3824 |
15 | 479179995 |
hex | 2b081ef68 |
11551240040 has 32 divisors (see below), whose sum is σ = 26104805280. Its totient is φ = 4600137792.
The previous prime is 11551240007. The next prime is 11551240073. The reversal of 11551240040 is 4004215511.
It is an interprime number because it is at equal distance from previous prime (11551240007) and next prime (11551240073).
It is a super-2 number, since 2×115512400402 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 11551239988 and 11551240015.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 627002 + ... + 645161.
It is an arithmetic number, because the mean of its divisors is an integer number (815775165).
Almost surely, 211551240040 is an apocalyptic number.
11551240040 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11551240040 is an abundant number, since it is smaller than the sum of its proper divisors (14553565240).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11551240040 is a wasteful number, since it uses less digits than its factorization.
11551240040 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1272401 (or 1272397 counting only the distinct ones).
The product of its (nonzero) digits is 800, while the sum is 23.
Adding to 11551240040 its reverse (4004215511), we get a palindrome (15555455551).
The spelling of 11551240040 in words is "eleven billion, five hundred fifty-one million, two hundred forty thousand, forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •