Base | Representation |
---|---|
bin | 101101110011001000001010… |
… | …011000011001001101111001 |
3 | 222102012002112221020101220022 |
4 | 231303020022120121031321 |
5 | 202400124011401232323 |
6 | 1552221342002140225 |
7 | 60266341625025542 |
oct | 5563101230311571 |
9 | 872162487211808 |
10 | 201425550414713 |
11 | 591a9107068359 |
12 | 1a711755351675 |
13 | 885146a456431 |
14 | 37a50977334c9 |
15 | 184481a3974c8 |
hex | b7320a619379 |
201425550414713 has 2 divisors, whose sum is σ = 201425550414714. Its totient is φ = 201425550414712.
The previous prime is 201425550414607. The next prime is 201425550414719. The reversal of 201425550414713 is 317414055524102.
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., 189500773701184 + 11924776713529 = 13765928^2 + 3453227^2 .
It is a cyclic number.
It is not a de Polignac number, because 201425550414713 - 244 = 183833364370297 is a prime.
It is not a weakly prime, because it can be changed into another prime (201425550414719) 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, 100712775207356 + 100712775207357.
It is an arithmetic number, because the mean of its divisors is an integer number (100712775207357).
Almost surely, 2201425550414713 is an apocalyptic number.
It is an amenable number.
201425550414713 is a deficient number, since it is larger than the sum of its proper divisors (1).
201425550414713 is an equidigital number, since it uses as much as digits as its factorization.
201425550414713 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 672000, while the sum is 44.
The spelling of 201425550414713 in words is "two hundred one trillion, four hundred twenty-five billion, five hundred fifty million, four hundred fourteen thousand, seven hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.098 sec. • engine limits •