Base | Representation |
---|---|
bin | 110001011001000011101001… |
… | …0110010001001101001110101 |
3 | 2002222021020111011220212202002 |
4 | 1202302013102302021221311 |
5 | 423421031414443120024 |
6 | 4140000354350425045 |
7 | 160340101365503144 |
oct | 14262072262115165 |
9 | 2088236434825662 |
10 | 434452363254389 |
11 | 1164802379a8767 |
12 | 40887941502185 |
13 | 158558b3654c4c |
14 | 793d86c63d75b |
15 | 35361828696ae |
hex | 18b21d2c89a75 |
434452363254389 has 2 divisors, whose sum is σ = 434452363254390. Its totient is φ = 434452363254388.
The previous prime is 434452363254383. The next prime is 434452363254493. The reversal of 434452363254389 is 983452363254434.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 283147356882289 + 151305006372100 = 16826983^2 + 12300610^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-434452363254389 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (434452363254383) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 217226181627194 + 217226181627195.
It is an arithmetic number, because the mean of its divisors is an integer number (217226181627195).
Almost surely, 2434452363254389 is an apocalyptic number.
It is an amenable number.
434452363254389 is a deficient number, since it is larger than the sum of its proper divisors (1).
434452363254389 is an equidigital number, since it uses as much as digits as its factorization.
434452363254389 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 895795200, while the sum is 65.
The spelling of 434452363254389 in words is "four hundred thirty-four trillion, four hundred fifty-two billion, three hundred sixty-three million, two hundred fifty-four thousand, three hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •