Base | Representation |
---|---|
bin | 101001111111000111… |
… | …1111001101001001011 |
3 | 22121201202012212111122 |
4 | 1103332033321221023 |
5 | 2434124210131201 |
6 | 105230551145455 |
7 | 6341241143303 |
oct | 1237617715113 |
9 | 277652185448 |
10 | 90164927051 |
11 | 35269829241 |
12 | 1558407528b |
13 | 866c049554 |
14 | 4514b90603 |
15 | 252aaa8e1b |
hex | 14fe3f9a4b |
90164927051 has 8 divisors (see below), whose sum is σ = 91782507840. Its totient is φ = 88557682752.
The previous prime is 90164927011. The next prime is 90164927057. The reversal of 90164927051 is 15072946109.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 90164927051 - 234 = 72985057867 is a prime.
It is a super-3 number, since 3×901649270513 (a number of 34 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 90164926993 and 90164927011.
It is not an unprimeable number, because it can be changed into a prime (90164927057) 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 in 7 ways as a sum of consecutive naturals, for example, 2566520 + ... + 2601413.
It is an arithmetic number, because the mean of its divisors is an integer number (11472813480).
Almost surely, 290164927051 is an apocalyptic number.
90164927051 is a deficient number, since it is larger than the sum of its proper divisors (1617580789).
90164927051 is a wasteful number, since it uses less digits than its factorization.
90164927051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5168245.
The product of its (nonzero) digits is 136080, while the sum is 44.
The spelling of 90164927051 in words is "ninety billion, one hundred sixty-four million, nine hundred twenty-seven thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.861 sec. • engine limits •