Base | Representation |
---|---|
bin | 1001010011001100011001… |
… | …1111001011101011010001 |
3 | 1100012112102101012112111001 |
4 | 2110303012133023223101 |
5 | 2320013010132240122 |
6 | 33425243441222001 |
7 | 2103520521565156 |
oct | 224630637135321 |
9 | 40175371175431 |
10 | 10225352227537 |
11 | 3292602837a87 |
12 | 11918a9931901 |
13 | 592328966c65 |
14 | 274ca428422d |
15 | 12aeb8e63527 |
hex | 94cc67cbad1 |
10225352227537 has 2 divisors, whose sum is σ = 10225352227538. Its totient is φ = 10225352227536.
The previous prime is 10225352227529. The next prime is 10225352227547. The reversal of 10225352227537 is 73572225352201.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10223136548496 + 2215679041 = 3197364^2 + 47071^2 .
It is a cyclic number.
It is not a de Polignac number, because 10225352227537 - 23 = 10225352227529 is a prime.
It is not a weakly prime, because it can be changed into another prime (10225352227507) 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, 5112676113768 + 5112676113769.
It is an arithmetic number, because the mean of its divisors is an integer number (5112676113769).
Almost surely, 210225352227537 is an apocalyptic number.
It is an amenable number.
10225352227537 is a deficient number, since it is larger than the sum of its proper divisors (1).
10225352227537 is an equidigital number, since it uses as much as digits as its factorization.
10225352227537 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1764000, while the sum is 46.
Adding to 10225352227537 its reverse (73572225352201), we get a palindrome (83797577579738).
The spelling of 10225352227537 in words is "ten trillion, two hundred twenty-five billion, three hundred fifty-two million, two hundred twenty-seven thousand, five hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.129 sec. • engine limits •