Base | Representation |
---|---|
bin | 110001010001100100111011… |
… | …0010010000000011100110101 |
3 | 2002211121221220200010211110221 |
4 | 1202203021312102000130311 |
5 | 423302210443404443334 |
6 | 4133452214154214341 |
7 | 160202605360302601 |
oct | 14243116622003465 |
9 | 2084557820124427 |
10 | 433424314140469 |
11 | 116114245a90393 |
12 | 40740651a243b1 |
13 | 157ac9782336a2 |
14 | 7905bc4d00501 |
15 | 35195638d98b4 |
hex | 18a3276480735 |
433424314140469 has 2 divisors, whose sum is σ = 433424314140470. Its totient is φ = 433424314140468.
The previous prime is 433424314140403. The next prime is 433424314140491. The reversal of 433424314140469 is 964041413424334.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 429240910696900 + 4183403443569 = 20718130^2 + 2045337^2 .
It is a cyclic number.
It is not a de Polignac number, because 433424314140469 - 235 = 433389954402101 is a prime.
It is a super-2 number, since 2×4334243141404692 (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 (433424314147469) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 216712157070234 + 216712157070235.
It is an arithmetic number, because the mean of its divisors is an integer number (216712157070235).
Almost surely, 2433424314140469 is an apocalyptic number.
It is an amenable number.
433424314140469 is a deficient number, since it is larger than the sum of its proper divisors (1).
433424314140469 is an equidigital number, since it uses as much as digits as its factorization.
433424314140469 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 11943936, while the sum is 52.
The spelling of 433424314140469 in words is "four hundred thirty-three trillion, four hundred twenty-four billion, three hundred fourteen million, one hundred forty thousand, four hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •