Base | Representation |
---|---|
bin | 111100101110010010… |
… | …0001101000010000001 |
3 | 110110120221101122012210 |
4 | 1321130210031002001 |
5 | 4114030403411223 |
6 | 135523355412333 |
7 | 12264324552555 |
oct | 1713444150201 |
9 | 413527348183 |
10 | 130402013313 |
11 | 5033759a740 |
12 | 213334540a9 |
13 | c3b226c630 |
14 | 6450a35865 |
15 | 35d32c3893 |
hex | 1e5c90d081 |
130402013313 has 32 divisors (see below), whose sum is σ = 204289771392. Its totient is φ = 72943718400.
The previous prime is 130402013309. The next prime is 130402013317. The reversal of 130402013313 is 313310204031.
It is an interprime number because it is at equal distance from previous prime (130402013309) and next prime (130402013317).
It is not a de Polignac number, because 130402013313 - 22 = 130402013309 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 130402013313.
It is not an unprimeable number, because it can be changed into a prime (130402013317) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 6457953 + ... + 6478113.
It is an arithmetic number, because the mean of its divisors is an integer number (6384055356).
Almost surely, 2130402013313 is an apocalyptic number.
130402013313 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
130402013313 is a deficient number, since it is larger than the sum of its proper divisors (73887758079).
130402013313 is a wasteful number, since it uses less digits than its factorization.
130402013313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 35265.
The product of its (nonzero) digits is 648, while the sum is 21.
Adding to 130402013313 its reverse (313310204031), we get a palindrome (443712217344).
The spelling of 130402013313 in words is "one hundred thirty billion, four hundred two million, thirteen thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •