Base | Representation |
---|---|
bin | 11101101010000001100011… |
… | …111110101100010000010101 |
3 | 122002211002211200002122220221 |
4 | 131222001203332230100111 |
5 | 114043441142010123014 |
6 | 1141223141510154341 |
7 | 36321226552135225 |
oct | 3552014376542025 |
9 | 562732750078827 |
10 | 130431244223509 |
11 | 38617642035149 |
12 | 127665479529b1 |
13 | 57a17c8c94b38 |
14 | 242cc97b2c085 |
15 | 1012c38e3eb24 |
hex | 76a063fac415 |
130431244223509 has 2 divisors, whose sum is σ = 130431244223510. Its totient is φ = 130431244223508.
The previous prime is 130431244223353. The next prime is 130431244223561. The reversal of 130431244223509 is 905322442134031.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 86077016172900 + 44354228050609 = 9277770^2 + 6659897^2 .
It is a cyclic number.
It is not a de Polignac number, because 130431244223509 - 29 = 130431244222997 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (130431244227509) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65215622111754 + 65215622111755.
It is an arithmetic number, because the mean of its divisors is an integer number (65215622111755).
Almost surely, 2130431244223509 is an apocalyptic number.
It is an amenable number.
130431244223509 is a deficient number, since it is larger than the sum of its proper divisors (1).
130431244223509 is an equidigital number, since it uses as much as digits as its factorization.
130431244223509 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 622080, while the sum is 43.
The spelling of 130431244223509 in words is "one hundred thirty trillion, four hundred thirty-one billion, two hundred forty-four million, two hundred twenty-three thousand, five hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •