Base | Representation |
---|---|
bin | 110001010110101110001110… |
… | …1111111001101000000000101 |
3 | 2002221010120021211122122221002 |
4 | 1202231130131333031000011 |
5 | 423400302304104414343 |
6 | 4135153131533303045 |
7 | 160304652223426331 |
oct | 14255343577150005 |
9 | 2087116254578832 |
10 | 434131502419973 |
11 | 116367155370846 |
12 | 40835715934a85 |
13 | 1583156a9b8b47 |
14 | 792c110b727c1 |
15 | 352cb53a9c8b8 |
hex | 18ad71dfcd005 |
434131502419973 has 2 divisors, whose sum is σ = 434131502419974. Its totient is φ = 434131502419972.
The previous prime is 434131502419969. The next prime is 434131502420039. The reversal of 434131502419973 is 379914205131434.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 434073140074084 + 58362345889 = 20834422^2 + 241583^2 .
It is a cyclic number.
It is not a de Polignac number, because 434131502419973 - 22 = 434131502419969 is a prime.
It is a super-2 number, since 2×4341315024199732 (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 (434131502419943) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 217065751209986 + 217065751209987.
It is an arithmetic number, because the mean of its divisors is an integer number (217065751209987).
Almost surely, 2434131502419973 is an apocalyptic number.
It is an amenable number.
434131502419973 is a deficient number, since it is larger than the sum of its proper divisors (1).
434131502419973 is an equidigital number, since it uses as much as digits as its factorization.
434131502419973 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 9797760, while the sum is 56.
The spelling of 434131502419973 in words is "four hundred thirty-four trillion, one hundred thirty-one billion, five hundred two million, four hundred nineteen thousand, nine hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.118 sec. • engine limits •