Base | Representation |
---|---|
bin | 100001101101001… |
… | …1101100101101101 |
3 | 2220211012021121120 |
4 | 1003122131211231 |
5 | 4304014313123 |
6 | 304121251153 |
7 | 40012300311 |
oct | 10332354555 |
9 | 2824167546 |
10 | 1131010413 |
11 | 530475955 |
12 | 276933ab9 |
13 | 15041a840 |
14 | aa2d1b41 |
15 | 6945e2e3 |
hex | 4369d96d |
1131010413 has 16 divisors (see below), whose sum is σ = 1667909376. Its totient is φ = 677194560.
The previous prime is 1131010409. The next prime is 1131010427. The reversal of 1131010413 is 3140101311.
It is not a de Polignac number, because 1131010413 - 22 = 1131010409 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1131010392 and 1131010401.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1131010313) by changing a digit.
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, 390453 + ... + 393338.
It is an arithmetic number, because the mean of its divisors is an integer number (104244336).
Almost surely, 21131010413 is an apocalyptic number.
1131010413 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
1131010413 is a deficient number, since it is larger than the sum of its proper divisors (536898963).
1131010413 is a wasteful number, since it uses less digits than its factorization.
1131010413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 783844.
The product of its (nonzero) digits is 36, while the sum is 15.
The square root of 1131010413 is about 33630.4982567907. The cubic root of 1131010413 is about 1041.8907950904.
Adding to 1131010413 its reverse (3140101311), we get a palindrome (4271111724).
The spelling of 1131010413 in words is "one billion, one hundred thirty-one million, ten thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •