Base | Representation |
---|---|
bin | 100111101000111… |
… | …1110101000000111 |
3 | 10102200211202001121 |
4 | 1033101332220013 |
5 | 10211002104111 |
6 | 335552534411 |
7 | 44650526362 |
oct | 11721765007 |
9 | 3380752047 |
10 | 1330113031 |
11 | 6228a5675 |
12 | 311551407 |
13 | 18274c540 |
14 | c891d0d9 |
15 | 7bb8c871 |
hex | 4f47ea07 |
1330113031 has 16 divisors (see below), whose sum is σ = 1596520800. Its totient is φ = 1094750208.
The previous prime is 1330112999. The next prime is 1330113047. The reversal of 1330113031 is 1303110331.
It is not a de Polignac number, because 1330113031 - 25 = 1330112999 is a prime.
It is a super-2 number, since 2×13301130312 = 3538401350472013922, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1330112996 and 1330113014.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1330110031) 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, 154186 + ... + 162583.
It is an arithmetic number, because the mean of its divisors is an integer number (99782550).
Almost surely, 21330113031 is an apocalyptic number.
1330113031 is a deficient number, since it is larger than the sum of its proper divisors (266407769).
1330113031 is a wasteful number, since it uses less digits than its factorization.
1330113031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 316818.
The product of its (nonzero) digits is 81, while the sum is 16.
The square root of 1330113031 is about 36470.7147037181. The cubic root of 1330113031 is about 1099.7556016264.
Adding to 1330113031 its reverse (1303110331), we get a palindrome (2633223362).
The spelling of 1330113031 in words is "one billion, three hundred thirty million, one hundred thirteen thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •