Base | Representation |
---|---|
bin | 110000011000001010110111… |
… | …1011110110000111011111101 |
3 | 2001210200200112011110102000112 |
4 | 1200300111233132300323331 |
5 | 421233423314322342113 |
6 | 4105011440204035405 |
7 | 155426561523216524 |
oct | 14060255736607375 |
9 | 2053620464412015 |
10 | 425534345121533 |
11 | 11365211418884a |
12 | 3b8874a7232b65 |
13 | 15359941395b1b |
14 | 7711d879cb4bb |
15 | 342e1d163b5a8 |
hex | 183056f7b0efd |
425534345121533 has 2 divisors, whose sum is σ = 425534345121534. Its totient is φ = 425534345121532.
The previous prime is 425534345121517. The next prime is 425534345121551. The reversal of 425534345121533 is 335121543435524.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 411357779749849 + 14176565371684 = 20281957^2 + 3765178^2 .
It is a cyclic number.
It is not a de Polignac number, because 425534345121533 - 24 = 425534345121517 is a prime.
It is a super-2 number, since 2×4255343451215332 (a number of 30 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (425534345129533) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 212767172560766 + 212767172560767.
It is an arithmetic number, because the mean of its divisors is an integer number (212767172560767).
Almost surely, 2425534345121533 is an apocalyptic number.
It is an amenable number.
425534345121533 is a deficient number, since it is larger than the sum of its proper divisors (1).
425534345121533 is an equidigital number, since it uses as much as digits as its factorization.
425534345121533 is an evil number, because the sum of its binary digits is even.
The product of its digits is 12960000, while the sum is 50.
The spelling of 425534345121533 in words is "four hundred twenty-five trillion, five hundred thirty-four billion, three hundred forty-five million, one hundred twenty-one thousand, five hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •