Base | Representation |
---|---|
bin | 1100100010111001110… |
… | …01111011101011011001 |
3 | 1112012121222211011121001 |
4 | 12101130321323223121 |
5 | 24030300141420441 |
6 | 530005113345001 |
7 | 43066645421314 |
oct | 6213471735331 |
9 | 1465558734531 |
10 | 431055420121 |
11 | 15689a602167 |
12 | 6b65b708161 |
13 | 31857575a91 |
14 | 16c1286397b |
15 | b32ceee731 |
hex | 645ce7bad9 |
431055420121 has 2 divisors, whose sum is σ = 431055420122. Its totient is φ = 431055420120.
The previous prime is 431055420109. The next prime is 431055420127. The reversal of 431055420121 is 121024550134.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 429039410121 + 2016010000 = 655011^2 + 44900^2 .
It is a cyclic number.
It is not a de Polignac number, because 431055420121 - 225 = 431021865689 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 431055420121.
It is not a weakly prime, because it can be changed into another prime (431055420127) 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, 215527710060 + 215527710061.
It is an arithmetic number, because the mean of its divisors is an integer number (215527710061).
Almost surely, 2431055420121 is an apocalyptic number.
It is an amenable number.
431055420121 is a deficient number, since it is larger than the sum of its proper divisors (1).
431055420121 is an equidigital number, since it uses as much as digits as its factorization.
431055420121 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4800, while the sum is 28.
Adding to 431055420121 its reverse (121024550134), we get a palindrome (552079970255).
The spelling of 431055420121 in words is "four hundred thirty-one billion, fifty-five million, four hundred twenty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •