Base | Representation |
---|---|
bin | 110001000010111011111011… |
… | …1111101011001001101011101 |
3 | 2002120111121011111112100221022 |
4 | 1202011313313331121031131 |
5 | 423021224040412104432 |
6 | 4125312001124013525 |
7 | 156604333152256115 |
oct | 14205676775311535 |
9 | 2076447144470838 |
10 | 431412150113117 |
11 | 115508957935838 |
12 | 404766942312a5 |
13 | 15694cb6866bc4 |
14 | 7876660b36045 |
15 | 34d2047a8ab12 |
hex | 1885df7f5935d |
431412150113117 has 2 divisors, whose sum is σ = 431412150113118. Its totient is φ = 431412150113116.
The previous prime is 431412150113099. The next prime is 431412150113143. The reversal of 431412150113117 is 711311051214134.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 390559331105476 + 40852819007641 = 19762574^2 + 6391621^2 .
It is a cyclic number.
It is not a de Polignac number, because 431412150113117 - 212 = 431412150109021 is a prime.
It is a super-2 number, since 2×4314121501131172 (a number of 30 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (431412150112117) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 215706075056558 + 215706075056559.
It is an arithmetic number, because the mean of its divisors is an integer number (215706075056559).
Almost surely, 2431412150113117 is an apocalyptic number.
It is an amenable number.
431412150113117 is a deficient number, since it is larger than the sum of its proper divisors (1).
431412150113117 is an equidigital number, since it uses as much as digits as its factorization.
431412150113117 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 10080, while the sum is 35.
The spelling of 431412150113117 in words is "four hundred thirty-one trillion, four hundred twelve billion, one hundred fifty million, one hundred thirteen thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •