Base | Representation |
---|---|
bin | 111100100110001101… |
… | …1001000011111011101 |
3 | 110102220001210220010210 |
4 | 1321030123020133131 |
5 | 4113002041344330 |
6 | 135440443123033 |
7 | 12254525643354 |
oct | 1711433103735 |
9 | 412801726123 |
10 | 130131199965 |
11 | 50208740658 |
12 | 21278813479 |
13 | c36b120550 |
14 | 6426a9c99b |
15 | 35b962c8b0 |
hex | 1e4c6c87dd |
130131199965 has 32 divisors (see below), whose sum is σ = 224339020416. Its totient is φ = 64032318720.
The previous prime is 130131199963. The next prime is 130131199967. The reversal of 130131199965 is 569991131031.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (130131199963) and next prime (130131199967).
It is not a de Polignac number, because 130131199965 - 21 = 130131199963 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130131199963) 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, 222330 + ... + 556500.
It is an arithmetic number, because the mean of its divisors is an integer number (7010594388).
Almost surely, 2130131199965 is an apocalyptic number.
130131199965 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
130131199965 is a deficient number, since it is larger than the sum of its proper divisors (94207820451).
130131199965 is a wasteful number, since it uses less digits than its factorization.
130131199965 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 336189.
The product of its (nonzero) digits is 196830, while the sum is 48.
The spelling of 130131199965 in words is "one hundred thirty billion, one hundred thirty-one million, one hundred ninety-nine thousand, nine hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •