Base | Representation |
---|---|
bin | 110001000000110000010100… |
… | …0111111011111101111011101 |
3 | 2002112102221021011202101200022 |
4 | 1202001200220333133233131 |
5 | 423001321020202141041 |
6 | 4124522133520041525 |
7 | 156543560210210615 |
oct | 14201405077375735 |
9 | 2075387234671608 |
10 | 431112325037021 |
11 | 11540278a454451 |
12 | 404285594632a5 |
13 | 15672944052884 |
14 | 7865d3ad29a45 |
15 | 34c934a93124b |
hex | 1881828fdfbdd |
431112325037021 has 2 divisors, whose sum is σ = 431112325037022. Its totient is φ = 431112325037020.
The previous prime is 431112325036993. The next prime is 431112325037027. The reversal of 431112325037021 is 120730523211134.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 372526863912025 + 58585461124996 = 19300955^2 + 7654114^2 .
It is a cyclic number.
It is not a de Polignac number, because 431112325037021 - 218 = 431112324774877 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (431112325037027) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 215556162518510 + 215556162518511.
It is an arithmetic number, because the mean of its divisors is an integer number (215556162518511).
Almost surely, 2431112325037021 is an apocalyptic number.
It is an amenable number.
431112325037021 is a deficient number, since it is larger than the sum of its proper divisors (1).
431112325037021 is an equidigital number, since it uses as much as digits as its factorization.
431112325037021 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 30240, while the sum is 35.
Adding to 431112325037021 its reverse (120730523211134), we get a palindrome (551842848248155).
The spelling of 431112325037021 in words is "four hundred thirty-one trillion, one hundred twelve billion, three hundred twenty-five million, thirty-seven thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •