Base | Representation |
---|---|
bin | 10100100100001101… |
… | …11000101111100110 |
3 | 1001111110222202102011 |
4 | 22102012320233212 |
5 | 140103022312124 |
6 | 5023335304434 |
7 | 540416523400 |
oct | 122206705746 |
9 | 31443882364 |
10 | 11041213414 |
11 | 4756528070 |
12 | 218181b11a |
13 | 106c62759a |
14 | 76a55bb70 |
15 | 4494d0994 |
hex | 2921b8be6 |
11041213414 has 48 divisors (see below), whose sum is σ = 22253570640. Its totient is φ = 4048719360.
The previous prime is 11041213409. The next prime is 11041213429. The reversal of 11041213414 is 41431214011.
11041213414 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (22).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 282919 + ... + 319570.
It is an arithmetic number, because the mean of its divisors is an integer number (463616055).
Almost surely, 211041213414 is an apocalyptic number.
11041213414 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
11041213414 is an abundant number, since it is smaller than the sum of its proper divisors (11212357226).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11041213414 is a wasteful number, since it uses less digits than its factorization.
11041213414 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 602533 (or 602526 counting only the distinct ones).
The product of its (nonzero) digits is 384, while the sum is 22.
Adding to 11041213414 its reverse (41431214011), we get a palindrome (52472427425).
The spelling of 11041213414 in words is "eleven billion, forty-one million, two hundred thirteen thousand, four hundred fourteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •