Base | Representation |
---|---|
bin | 111001010100001101000001… |
… | …0011111011111001100111101 |
3 | 2110010001122200220112001011102 |
4 | 1302220122002133133030331 |
5 | 1012040024433322301141 |
6 | 4544125100244502445 |
7 | 211122633051141512 |
oct | 16250320237371475 |
9 | 2403048626461142 |
10 | 504154040431421 |
11 | 136703589611506 |
12 | 486645200aaa25 |
13 | 188406a2b482a3 |
14 | 8c6d2859c7309 |
15 | 3d4430c04799b |
hex | 1ca86827df33d |
504154040431421 has 2 divisors, whose sum is σ = 504154040431422. Its totient is φ = 504154040431420.
The previous prime is 504154040431369. The next prime is 504154040431463. The reversal of 504154040431421 is 124134040451405.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 490863743148025 + 13290297283396 = 22155445^2 + 3645586^2 .
It is a cyclic number.
It is not a de Polignac number, because 504154040431421 - 214 = 504154040415037 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (504154040431121) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 252077020215710 + 252077020215711.
It is an arithmetic number, because the mean of its divisors is an integer number (252077020215711).
Almost surely, 2504154040431421 is an apocalyptic number.
It is an amenable number.
504154040431421 is a deficient number, since it is larger than the sum of its proper divisors (1).
504154040431421 is an equidigital number, since it uses as much as digits as its factorization.
504154040431421 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 153600, while the sum is 38.
Adding to 504154040431421 its reverse (124134040451405), we get a palindrome (628288080882826).
The spelling of 504154040431421 in words is "five hundred four trillion, one hundred fifty-four billion, forty million, four hundred thirty-one thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •