Base | Representation |
---|---|
bin | 111111010110011101001… |
… | …100000110100100110101 |
3 | 120102011222122122120112112 |
4 | 333112131030012210311 |
5 | 1032311320400111141 |
6 | 13131535311500405 |
7 | 626345164335104 |
oct | 77263514064465 |
9 | 16364878576475 |
10 | 4353439066421 |
11 | 142931294a475 |
12 | 5a3885b27705 |
13 | 2576b201a7b3 |
14 | 1109c982c03b |
15 | 78399dd17eb |
hex | 3f59d306935 |
4353439066421 has 2 divisors, whose sum is σ = 4353439066422. Its totient is φ = 4353439066420.
The previous prime is 4353439066357. The next prime is 4353439066513. The reversal of 4353439066421 is 1246609343534.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 3773345100100 + 580093966321 = 1942510^2 + 761639^2 .
It is a cyclic number.
It is not a de Polignac number, because 4353439066421 - 26 = 4353439066357 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 4353439066421.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4353439066121) 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, 2176719533210 + 2176719533211.
It is an arithmetic number, because the mean of its divisors is an integer number (2176719533211).
Almost surely, 24353439066421 is an apocalyptic number.
It is an amenable number.
4353439066421 is a deficient number, since it is larger than the sum of its proper divisors (1).
4353439066421 is an equidigital number, since it uses as much as digits as its factorization.
4353439066421 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5598720, while the sum is 50.
The spelling of 4353439066421 in words is "four trillion, three hundred fifty-three billion, four hundred thirty-nine million, sixty-six thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •