Base | Representation |
---|---|
bin | 100111001001010… |
… | …1011100111111011 |
3 | 10101112121201212110 |
4 | 1032102223213323 |
5 | 10142230120443 |
6 | 334201143403 |
7 | 44356510506 |
oct | 11622534773 |
9 | 3345551773 |
10 | 1313520123 |
11 | 6144a2123 |
12 | 307a8ab63 |
13 | 17c18cb56 |
14 | c664013d |
15 | 7a4b1233 |
hex | 4e4ab9fb |
1313520123 has 16 divisors (see below), whose sum is σ = 1790138880. Its totient is φ = 856498656.
The previous prime is 1313520073. The next prime is 1313520149. The reversal of 1313520123 is 3210253131.
It is not a de Polignac number, because 1313520123 - 213 = 1313511931 is a prime.
It is a super-2 number, since 2×13135201232 = 3450670227051870258, 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 1313520123.
It is not an unprimeable number, because it can be changed into a prime (1313520163) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 540 + ... + 51257.
It is an arithmetic number, because the mean of its divisors is an integer number (111883680).
Almost surely, 21313520123 is an apocalyptic number.
1313520123 is a deficient number, since it is larger than the sum of its proper divisors (476618757).
1313520123 is a wasteful number, since it uses less digits than its factorization.
1313520123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 51986.
The product of its (nonzero) digits is 540, while the sum is 21.
The square root of 1313520123 is about 36242.5181658229. The cubic root of 1313520123 is about 1095.1633717167.
Adding to 1313520123 its reverse (3210253131), we get a palindrome (4523773254).
The spelling of 1313520123 in words is "one billion, three hundred thirteen million, five hundred twenty thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •