Base | Representation |
---|---|
bin | 110000011001100111000010… |
… | …1011000000010111001000001 |
3 | 2001211101121102122122112120121 |
4 | 1200303032011120002321001 |
5 | 421300144202411020213 |
6 | 4105242413155540241 |
7 | 155450066541100615 |
oct | 14063160530027101 |
9 | 2054347378575517 |
10 | 425732280954433 |
11 | 113719056865722 |
12 | 3b8b99275ba681 |
13 | 153724c6b6203b |
14 | 771b7a38ad345 |
15 | 343441877588d |
hex | 1833385602e41 |
425732280954433 has 2 divisors, whose sum is σ = 425732280954434. Its totient is φ = 425732280954432.
The previous prime is 425732280954389. The next prime is 425732280954439. The reversal of 425732280954433 is 334459082237524.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 416643702069904 + 9088578884529 = 20411852^2 + 3014727^2 .
It is a cyclic number.
It is not a de Polignac number, because 425732280954433 - 213 = 425732280946241 is a prime.
It is not a weakly prime, because it can be changed into another prime (425732280954439) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 212866140477216 + 212866140477217.
It is an arithmetic number, because the mean of its divisors is an integer number (212866140477217).
Almost surely, 2425732280954433 is an apocalyptic number.
It is an amenable number.
425732280954433 is a deficient number, since it is larger than the sum of its proper divisors (1).
425732280954433 is an equidigital number, since it uses as much as digits as its factorization.
425732280954433 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 174182400, while the sum is 61.
The spelling of 425732280954433 in words is "four hundred twenty-five trillion, seven hundred thirty-two billion, two hundred eighty million, nine hundred fifty-four thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •