Base | Representation |
---|---|
bin | 1100100011010000011… |
… | …11001100001011111001 |
3 | 1112020010020120100222012 |
4 | 12101220033030023321 |
5 | 24031142324322022 |
6 | 530040024335305 |
7 | 43104444425024 |
oct | 6215017141371 |
9 | 1466106510865 |
10 | 431245542137 |
11 | 1569879586a3 |
12 | 6b6b3314535 |
13 | 31887a81c07 |
14 | 16c2dbd41bb |
15 | b33ea56de2 |
hex | 64683cc2f9 |
431245542137 has 2 divisors, whose sum is σ = 431245542138. Its totient is φ = 431245542136.
The previous prime is 431245542131. The next prime is 431245542191. The reversal of 431245542137 is 731245542134.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 275059340521 + 156186201616 = 524461^2 + 395204^2 .
It is a cyclic number.
It is not a de Polignac number, because 431245542137 - 236 = 362526065401 is a prime.
It is a super-2 number, since 2×4312455421372 (a number of 24 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 431245542094 and 431245542103.
It is not a weakly prime, because it can be changed into another prime (431245542131) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 215622771068 + 215622771069.
It is an arithmetic number, because the mean of its divisors is an integer number (215622771069).
Almost surely, 2431245542137 is an apocalyptic number.
It is an amenable number.
431245542137 is a deficient number, since it is larger than the sum of its proper divisors (1).
431245542137 is an equidigital number, since it uses as much as digits as its factorization.
431245542137 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 403200, while the sum is 41.
The spelling of 431245542137 in words is "four hundred thirty-one billion, two hundred forty-five million, five hundred forty-two thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •