Base | Representation |
---|---|
bin | 11010101010001110001… |
… | …10110001000110010101 |
3 | 10020120102002002201101120 |
4 | 31111013012301012111 |
5 | 110002002333142412 |
6 | 1540451512514153 |
7 | 123115565643144 |
oct | 15250706610625 |
9 | 3216362081346 |
10 | 916020990357 |
11 | 323533a71aa0 |
12 | 1296456ab959 |
13 | 684c39b1465 |
14 | 3249b05d75b |
15 | 18c63cbbb8c |
hex | d5471b1195 |
916020990357 has 32 divisors (see below), whose sum is σ = 1345113074304. Its totient is φ = 549887020800.
The previous prime is 916020990341. The next prime is 916020990359. The reversal of 916020990357 is 753099020619.
It is a happy number.
It is not a de Polignac number, because 916020990357 - 24 = 916020990341 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (916020990359) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1363507 + ... + 1921247.
It is an arithmetic number, because the mean of its divisors is an integer number (42034783572).
Almost surely, 2916020990357 is an apocalyptic number.
It is an amenable number.
916020990357 is a deficient number, since it is larger than the sum of its proper divisors (429092083947).
916020990357 is a wasteful number, since it uses less digits than its factorization.
916020990357 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 558229.
The product of its (nonzero) digits is 918540, while the sum is 51.
The spelling of 916020990357 in words is "nine hundred sixteen billion, twenty million, nine hundred ninety thousand, three hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •