Base | Representation |
---|---|
bin | 100110110010101… |
… | …0111010101001000 |
3 | 10100201021012010011 |
4 | 1031211113111020 |
5 | 10131204444040 |
6 | 333054401304 |
7 | 44153522215 |
oct | 11545272510 |
9 | 3321235104 |
10 | 1301640520 |
11 | 608818874 |
12 | 303b00234 |
13 | 1798908bb |
14 | c4c2ab0c |
15 | 794163ea |
hex | 4d957548 |
1301640520 has 32 divisors (see below), whose sum is σ = 2941281720. Its totient is φ = 518417920.
The previous prime is 1301640517. The next prime is 1301640523. The reversal of 1301640520 is 250461031.
It is an interprime number because it is at equal distance from previous prime (1301640517) and next prime (1301640523).
It can be written as a sum of positive squares in 4 ways, for example, as 901080324 + 400560196 = 30018^2 + 20014^2 .
It is a junction number, because it is equal to n+sod(n) for n = 1301640491 and 1301640500.
It is not an unprimeable number, because it can be changed into a prime (1301640523) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 60511 + ... + 79150.
Almost surely, 21301640520 is an apocalyptic number.
1301640520 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1301640520 is an abundant number, since it is smaller than the sum of its proper divisors (1639641200).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1301640520 is a wasteful number, since it uses less digits than its factorization.
1301640520 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 139905 (or 139901 counting only the distinct ones).
The product of its (nonzero) digits is 720, while the sum is 22.
The square root of 1301640520 is about 36078.2555010632. The cubic root of 1301640520 is about 1091.8517803004.
The spelling of 1301640520 in words is "one billion, three hundred one million, six hundred forty thousand, five hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •