Base | Representation |
---|---|
bin | 101010001001001000… |
… | …1001111011000001010 |
3 | 22122121011021010111020 |
4 | 1110102101033120022 |
5 | 2440321202310123 |
6 | 105324150413310 |
7 | 6352460204400 |
oct | 1242221173012 |
9 | 278534233436 |
10 | 90500822538 |
11 | 3542139a515 |
12 | 15658661236 |
13 | 86c3804889 |
14 | 4547629470 |
15 | 254a3087e3 |
hex | 151244f60a |
90500822538 has 24 divisors (see below), whose sum is σ = 210552934752. Its totient is φ = 25857377784.
The previous prime is 90500822527. The next prime is 90500822539. The reversal of 90500822538 is 83522800509.
It is a super-2 number, since 2×905008225382 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is a self number, because there is not a number n which added to its sum of digits gives 90500822538.
It is not an unprimeable number, because it can be changed into a prime (90500822539) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 153912670 + ... + 153913257.
It is an arithmetic number, because the mean of its divisors is an integer number (8773038948).
Almost surely, 290500822538 is an apocalyptic number.
90500822538 is a gapful number since it is divisible by the number (98) formed by its first and last digit.
90500822538 is an abundant number, since it is smaller than the sum of its proper divisors (120052112214).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
90500822538 is a wasteful number, since it uses less digits than its factorization.
90500822538 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 307825946 (or 307825939 counting only the distinct ones).
The product of its (nonzero) digits is 172800, while the sum is 42.
The spelling of 90500822538 in words is "ninety billion, five hundred million, eight hundred twenty-two thousand, five hundred thirty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.120 sec. • engine limits •