Base | Representation |
---|---|
bin | 110000111001100111000101… |
… | …0111010101001001001011011 |
3 | 2002101222001210112222201201201 |
4 | 1201303032022322221021123 |
5 | 422334224100111434321 |
6 | 4122451104240255031 |
7 | 156412616536532656 |
oct | 14163161272511133 |
9 | 2071861715881651 |
10 | 430130420421211 |
11 | 11506431793a524 |
12 | 402aa1a7611477 |
13 | 156011809a3173 |
14 | 78305cdc5c89d |
15 | 34ada2cb15291 |
hex | 187338aea925b |
430130420421211 has 2 divisors, whose sum is σ = 430130420421212. Its totient is φ = 430130420421210.
The previous prime is 430130420421209. The next prime is 430130420421217. The reversal of 430130420421211 is 112124024031034.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 430130420421211 - 21 = 430130420421209 is a prime.
Together with 430130420421209, it forms a pair of twin primes.
It is a self number, because there is not a number n which added to its sum of digits gives 430130420421211.
It is not a weakly prime, because it can be changed into another prime (430130420421217) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 215065210210605 + 215065210210606.
It is an arithmetic number, because the mean of its divisors is an integer number (215065210210606).
Almost surely, 2430130420421211 is an apocalyptic number.
430130420421211 is a deficient number, since it is larger than the sum of its proper divisors (1).
430130420421211 is an equidigital number, since it uses as much as digits as its factorization.
430130420421211 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4608, while the sum is 28.
Adding to 430130420421211 its reverse (112124024031034), we get a palindrome (542254444452245).
The spelling of 430130420421211 in words is "four hundred thirty trillion, one hundred thirty billion, four hundred twenty million, four hundred twenty-one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •