Base | Representation |
---|---|
bin | 10100101110111101… |
… | …00101100011000100 |
3 | 1001201202112020212211 |
4 | 22113132211203010 |
5 | 140244103443244 |
6 | 5040314353204 |
7 | 542562410416 |
oct | 122736454304 |
9 | 31652466784 |
10 | 11131312324 |
11 | 47a2376780 |
12 | 21a7a2b804 |
13 | 10851b2552 |
14 | 7784d29b6 |
15 | 45237b934 |
hex | 2977a58c4 |
11131312324 has 48 divisors (see below), whose sum is σ = 22001958720. Its totient is φ = 4881107840.
The previous prime is 11131312271. The next prime is 11131312331. The reversal of 11131312324 is 42321313111.
11131312324 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×111313123242 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (22).
It is a junction number, because it is equal to n+sod(n) for n = 11131312295 and 11131312304.
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 15 ways as a sum of consecutive naturals, for example, 1902147 + ... + 1907989.
It is an arithmetic number, because the mean of its divisors is an integer number (458374140).
Almost surely, 211131312324 is an apocalyptic number.
It is an amenable number.
11131312324 is a deficient number, since it is larger than the sum of its proper divisors (10870646396).
11131312324 is a wasteful number, since it uses less digits than its factorization.
11131312324 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7380 (or 7378 counting only the distinct ones).
The product of its digits is 432, while the sum is 22.
Adding to 11131312324 its reverse (42321313111), we get a palindrome (53452625435).
The spelling of 11131312324 in words is "eleven billion, one hundred thirty-one million, three hundred twelve thousand, three hundred twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •