Base | Representation |
---|---|
bin | 100111010000100… |
… | …1001111001010101 |
3 | 10101210202111021100 |
4 | 1032201021321111 |
5 | 10144213023013 |
6 | 334414340313 |
7 | 44433661662 |
oct | 11641117125 |
9 | 3353674240 |
10 | 1317314133 |
11 | 616653673 |
12 | 3091ba699 |
13 | 17cbbaa25 |
14 | c6d4aa69 |
15 | 7a9b0473 |
hex | 4e849e55 |
1317314133 has 12 divisors (see below), whose sum is σ = 1949197068. Its totient is φ = 856789440.
The previous prime is 1317314113. The next prime is 1317314143. The reversal of 1317314133 is 3314137131.
1317314133 is a `hidden beast` number, since 1 + 317 + 314 + 1 + 33 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 635947524 + 681366609 = 25218^2 + 26103^2 .
It is not a de Polignac number, because 1317314133 - 25 = 1317314101 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 1317314097 and 1317314106.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1317314113) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1784610 + ... + 1785347.
It is an arithmetic number, because the mean of its divisors is an integer number (162433089).
Almost surely, 21317314133 is an apocalyptic number.
It is an amenable number.
1317314133 is a deficient number, since it is larger than the sum of its proper divisors (631882935).
1317314133 is a wasteful number, since it uses less digits than its factorization.
1317314133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3570004 (or 3570001 counting only the distinct ones).
The product of its digits is 2268, while the sum is 27.
The square root of 1317314133 is about 36294.8223993451. The cubic root of 1317314133 is about 1096.2167921111.
The spelling of 1317314133 in words is "one billion, three hundred seventeen million, three hundred fourteen thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.570 sec. • engine limits •