Base | Representation |
---|---|
bin | 10100011110110000111101… |
… | …010101010101110100000001 |
3 | 102210221002112102020210101202 |
4 | 110132300331111111310001 |
5 | 43301242232240330012 |
6 | 515323531045510545 |
7 | 24654465346556552 |
oct | 2436607525256401 |
9 | 383832472223352 |
10 | 90075083136257 |
11 | 267786a01a578a |
12 | a1291a3112455 |
13 | 3b350755816cb |
14 | 183592b83c329 |
15 | a630d6366cc2 |
hex | 51ec3d555d01 |
90075083136257 has 2 divisors, whose sum is σ = 90075083136258. Its totient is φ = 90075083136256.
The previous prime is 90075083136221. The next prime is 90075083136299. The reversal of 90075083136257 is 75263138057009.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 86927726838016 + 3147356298241 = 9323504^2 + 1774079^2 .
It is a cyclic number.
It is not a de Polignac number, because 90075083136257 - 212 = 90075083132161 is a prime.
It is a super-2 number, since 2×900750831362572 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (90075083139257) 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, 45037541568128 + 45037541568129.
It is an arithmetic number, because the mean of its divisors is an integer number (45037541568129).
Almost surely, 290075083136257 is an apocalyptic number.
It is an amenable number.
90075083136257 is a deficient number, since it is larger than the sum of its proper divisors (1).
90075083136257 is an equidigital number, since it uses as much as digits as its factorization.
90075083136257 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 9525600, while the sum is 56.
The spelling of 90075083136257 in words is "ninety trillion, seventy-five billion, eighty-three million, one hundred thirty-six thousand, two hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.127 sec. • engine limits •