Base | Representation |
---|---|
bin | 110000010111011011110111… |
… | …1100110100111111001110101 |
3 | 2001210100001000012110212111022 |
4 | 1200232313233212213321311 |
5 | 421230300113323401404 |
6 | 4104453225110550525 |
7 | 155416356430163204 |
oct | 14056675746477165 |
9 | 2053301005425438 |
10 | 425433415450229 |
11 | 113613330aa495a |
12 | 3b86ba1a068445 |
13 | 153502780a1524 |
14 | 770b1312c923b |
15 | 342b7759b38be |
hex | 182edef9a7e75 |
425433415450229 has 2 divisors, whose sum is σ = 425433415450230. Its totient is φ = 425433415450228.
The previous prime is 425433415450171. The next prime is 425433415450237. The reversal of 425433415450229 is 922054514334524.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 224836529702500 + 200596885747729 = 14994550^2 + 14163223^2 .
It is a cyclic number.
It is not a de Polignac number, because 425433415450229 - 212 = 425433415446133 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (425433415450259) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 212716707725114 + 212716707725115.
It is an arithmetic number, because the mean of its divisors is an integer number (212716707725115).
Almost surely, 2425433415450229 is an apocalyptic number.
It is an amenable number.
425433415450229 is a deficient number, since it is larger than the sum of its proper divisors (1).
425433415450229 is an equidigital number, since it uses as much as digits as its factorization.
425433415450229 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 20736000, while the sum is 53.
The spelling of 425433415450229 in words is "four hundred twenty-five trillion, four hundred thirty-three billion, four hundred fifteen million, four hundred fifty thousand, two hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •