Base | Representation |
---|---|
bin | 111101001101111100… |
… | …1001011101001110101 |
3 | 110120022222121101210212 |
4 | 1322123321023221311 |
5 | 4123214401233201 |
6 | 140221031555205 |
7 | 12332545422323 |
oct | 1723371135165 |
9 | 416288541725 |
10 | 131464477301 |
11 | 508322a7653 |
12 | 2158b22bb05 |
13 | c52140a151 |
14 | 6511ba2d13 |
15 | 36466e2abb |
hex | 1e9be4ba75 |
131464477301 has 4 divisors (see below), whose sum is σ = 131953193100. Its totient is φ = 130975761504.
The previous prime is 131464477289. The next prime is 131464477423. The reversal of 131464477301 is 103774464131.
It is a happy number.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 63807265201 + 67657212100 = 252601^2 + 260110^2 .
It is a cyclic number.
It is not a de Polignac number, because 131464477301 - 234 = 114284608117 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (131464477201) 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 in 3 ways as a sum of consecutive naturals, for example, 244357496 + ... + 244358033.
It is an arithmetic number, because the mean of its divisors is an integer number (32988298275).
Almost surely, 2131464477301 is an apocalyptic number.
It is an amenable number.
131464477301 is a deficient number, since it is larger than the sum of its proper divisors (488715799).
131464477301 is an equidigital number, since it uses as much as digits as its factorization.
131464477301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 488715798.
The product of its (nonzero) digits is 169344, while the sum is 41.
The spelling of 131464477301 in words is "one hundred thirty-one billion, four hundred sixty-four million, four hundred seventy-seven thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.184 sec. • engine limits •