Base | Representation |
---|---|
bin | 110000001111011010101101… |
… | …0100011101010111010100001 |
3 | 2001122102200112002002101121011 |
4 | 1200132311122203222322201 |
5 | 421104221203212240134 |
6 | 4102251053332500521 |
7 | 155243634513032602 |
oct | 14036653243527241 |
9 | 2048380462071534 |
10 | 424331403243169 |
11 | 113228a34919a24 |
12 | 3b71232847a741 |
13 | 152a03834668b6 |
14 | 76ada6c8a9da9 |
15 | 340cc7853d264 |
hex | 181ed5a8eaea1 |
424331403243169 has 2 divisors, whose sum is σ = 424331403243170. Its totient is φ = 424331403243168.
The previous prime is 424331403243131. The next prime is 424331403243191. The reversal of 424331403243169 is 961342304133424.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 213437110403169 + 210894292840000 = 14609487^2 + 14522200^2 .
It is a cyclic number.
It is not a de Polignac number, because 424331403243169 - 211 = 424331403241121 is a prime.
It is a super-2 number, since 2×4243314032431692 (a number of 30 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (424331403243569) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 212165701621584 + 212165701621585.
It is an arithmetic number, because the mean of its divisors is an integer number (212165701621585).
Almost surely, 2424331403243169 is an apocalyptic number.
It is an amenable number.
424331403243169 is a deficient number, since it is larger than the sum of its proper divisors (1).
424331403243169 is an equidigital number, since it uses as much as digits as its factorization.
424331403243169 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4478976, while the sum is 49.
The spelling of 424331403243169 in words is "four hundred twenty-four trillion, three hundred thirty-one billion, four hundred three million, two hundred forty-three thousand, one hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •