Base | Representation |
---|---|
bin | 11101111000011111001011… |
… | …000001010110111100111111 |
3 | 122020100010011220200122121210 |
4 | 131320133023001112330333 |
5 | 114211232111231440221 |
6 | 1143303510124055503 |
7 | 36453102516341100 |
oct | 3570371301267477 |
9 | 566303156618553 |
10 | 131425110421311 |
11 | 38970092650723 |
12 | 128a7097694593 |
13 | 5844447547605 |
14 | 246501b6963a7 |
15 | 102da06e3d276 |
hex | 7787cb056f3f |
131425110421311 has 96 divisors (see below), whose sum is σ = 209899339372800. Its totient is φ = 72901617761280.
The previous prime is 131425110421301. The next prime is 131425110421337. The reversal of 131425110421311 is 113124011524131.
It is not a de Polignac number, because 131425110421311 - 27 = 131425110421183 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (131425110421301) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 1489344151 + ... + 1489432391.
It is an arithmetic number, because the mean of its divisors is an integer number (2186451451800).
Almost surely, 2131425110421311 is an apocalyptic number.
131425110421311 is a deficient number, since it is larger than the sum of its proper divisors (78474228951489).
131425110421311 is a wasteful number, since it uses less digits than its factorization.
131425110421311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 90469 (or 90462 counting only the distinct ones).
The product of its (nonzero) digits is 2880, while the sum is 30.
Adding to 131425110421311 its reverse (113124011524131), we get a palindrome (244549121945442).
The spelling of 131425110421311 in words is "one hundred thirty-one trillion, four hundred twenty-five billion, one hundred ten million, four hundred twenty-one thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •