Base | Representation |
---|---|
bin | 1100100001011010010… |
… | …01101011000111010011 |
3 | 1112010120011021000101001 |
4 | 12100231021223013103 |
5 | 24022130041141321 |
6 | 525353413322431 |
7 | 43041046461655 |
oct | 6205511530723 |
9 | 1463504230331 |
10 | 430254240211 |
11 | 156519335904 |
12 | 6b477336417 |
13 | 3175a59bb23 |
14 | 16b782ac6d5 |
15 | b2d29e2c91 |
hex | 642d26b1d3 |
430254240211 has 2 divisors, whose sum is σ = 430254240212. Its totient is φ = 430254240210.
The previous prime is 430254240151. The next prime is 430254240281. The reversal of 430254240211 is 112042452034.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 430254240211 - 27 = 430254240083 is a prime.
It is a super-3 number, since 3×4302542402113 (a number of 36 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a self number, because there is not a number n which added to its sum of digits gives 430254240211.
It is not a weakly prime, because it can be changed into another prime (430254240281) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 215127120105 + 215127120106.
It is an arithmetic number, because the mean of its divisors is an integer number (215127120106).
Almost surely, 2430254240211 is an apocalyptic number.
430254240211 is a deficient number, since it is larger than the sum of its proper divisors (1).
430254240211 is an equidigital number, since it uses as much as digits as its factorization.
430254240211 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 7680, while the sum is 28.
Adding to 430254240211 its reverse (112042452034), we get a palindrome (542296692245).
The spelling of 430254240211 in words is "four hundred thirty billion, two hundred fifty-four million, two hundred forty thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.136 sec. • engine limits •