Base | Representation |
---|---|
bin | 10100100100000110… |
… | …00100110100111100 |
3 | 1001111102002222221010 |
4 | 22102003010310330 |
5 | 140102243324312 |
6 | 5023302035220 |
7 | 540405162540 |
oct | 122203046474 |
9 | 31442088833 |
10 | 11040214332 |
11 | 4755a05484 |
12 | 2181418b10 |
13 | 106c367904 |
14 | 76a37ba20 |
15 | 44938493c |
hex | 2920c4d3c |
11040214332 has 24 divisors (see below), whose sum is σ = 29440571776. Its totient is φ = 3154346928.
The previous prime is 11040214331. The next prime is 11040214333. The reversal of 11040214332 is 23341204011.
It is an interprime number because it is at equal distance from previous prime (11040214331) and next prime (11040214333).
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a junction number, because it is equal to n+sod(n) for n = 11040214299 and 11040214308.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11040214331) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 65715478 + ... + 65715645.
Almost surely, 211040214332 is an apocalyptic number.
11040214332 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
11040214332 is an abundant number, since it is smaller than the sum of its proper divisors (18400357444).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11040214332 is a wasteful number, since it uses less digits than its factorization.
11040214332 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 131431137 (or 131431135 counting only the distinct ones).
The product of its (nonzero) digits is 576, while the sum is 21.
Adding to 11040214332 its reverse (23341204011), we get a palindrome (34381418343).
The spelling of 11040214332 in words is "eleven billion, forty million, two hundred fourteen thousand, three hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •