Base | Representation |
---|---|
bin | 100001101011100… |
… | …0010100001101011 |
3 | 2220202111200202220 |
4 | 1003113002201223 |
5 | 4303302110011 |
6 | 304050125123 |
7 | 40001542320 |
oct | 10327024153 |
9 | 2822450686 |
10 | 1130113131 |
11 | 52aa127a4 |
12 | 2765807a3 |
13 | 1501952c4 |
14 | aa13ab47 |
15 | 69333506 |
hex | 435c286b |
1130113131 has 16 divisors (see below), whose sum is σ = 1823376384. Its totient is φ = 607791744.
The previous prime is 1130113129. The next prime is 1130113133. The reversal of 1130113131 is 1313110311.
It is an interprime number because it is at equal distance from previous prime (1130113129) and next prime (1130113133).
It is not a de Polignac number, because 1130113131 - 21 = 1130113129 is a prime.
It is a super-2 number, since 2×11301131312 = 2554311377717246322, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1130113131.
It is not an unprimeable number, because it can be changed into a prime (1130113133) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1582435 + ... + 1583148.
It is an arithmetic number, because the mean of its divisors is an integer number (113961024).
Almost surely, 21130113131 is an apocalyptic number.
1130113131 is a deficient number, since it is larger than the sum of its proper divisors (693263253).
1130113131 is a wasteful number, since it uses less digits than its factorization.
1130113131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3165610.
The product of its (nonzero) digits is 27, while the sum is 15.
The square root of 1130113131 is about 33617.1553079674. The cubic root of 1130113131 is about 1041.6151957444.
Adding to 1130113131 its reverse (1313110311), we get a palindrome (2443223442).
The spelling of 1130113131 in words is "one billion, one hundred thirty million, one hundred thirteen thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •