Base | Representation |
---|---|
bin | 101010001001001001… |
… | …1010001000001101101 |
3 | 22122121012021002221111 |
4 | 1110102103101001231 |
5 | 2440321321303311 |
6 | 105324210032021 |
7 | 6352464545542 |
oct | 1242223210155 |
9 | 278535232844 |
10 | 90501353581 |
11 | 354217224a1 |
12 | 15658878611 |
13 | 86c395c4c2 |
14 | 4547726bc9 |
15 | 254a3b0d21 |
hex | 15124d106d |
90501353581 has 2 divisors, whose sum is σ = 90501353582. Its totient is φ = 90501353580.
The previous prime is 90501353539. The next prime is 90501353617. The reversal of 90501353581 is 18535310509.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 80559468900 + 9941884681 = 283830^2 + 99709^2 .
It is an emirp because it is prime and its reverse (18535310509) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 90501353581 - 215 = 90501320813 is a prime.
It is a super-2 number, since 2×905013535812 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (90501353081) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 45250676790 + 45250676791.
It is an arithmetic number, because the mean of its divisors is an integer number (45250676791).
Almost surely, 290501353581 is an apocalyptic number.
It is an amenable number.
90501353581 is a deficient number, since it is larger than the sum of its proper divisors (1).
90501353581 is an equidigital number, since it uses as much as digits as its factorization.
90501353581 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 81000, while the sum is 40.
It can be divided in two parts, 9050 and 1353581, that added together give a palindrome (1362631).
The spelling of 90501353581 in words is "ninety billion, five hundred one million, three hundred fifty-three thousand, five hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •