Base | Representation |
---|---|
bin | 1110100001111000100… |
… | …11100111001001001001 |
3 | 1202201121001112001101120 |
4 | 13100330103213021021 |
5 | 31134404330332421 |
6 | 1021201524105453 |
7 | 51032222550255 |
oct | 7207423471111 |
9 | 1681531461346 |
10 | 499227980361 |
11 | 1827a31a8740 |
12 | 80906535289 |
13 | 38100213816 |
14 | 1a23c89d265 |
15 | cebce868c6 |
hex | 743c4e7249 |
499227980361 has 32 divisors (see below), whose sum is σ = 736448151552. Its totient is φ = 298275384960.
The previous prime is 499227980351. The next prime is 499227980399. The reversal of 499227980361 is 163089722994.
It is not a de Polignac number, because 499227980361 - 215 = 499227947593 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 499227980295 and 499227980304.
It is not an unprimeable number, because it can be changed into a prime (499227980351) 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, 5114136 + ... + 5210838.
It is an arithmetic number, because the mean of its divisors is an integer number (23014004736).
Almost surely, 2499227980361 is an apocalyptic number.
It is an amenable number.
499227980361 is a deficient number, since it is larger than the sum of its proper divisors (237220171191).
499227980361 is a wasteful number, since it uses less digits than its factorization.
499227980361 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 98933.
The product of its (nonzero) digits is 11757312, while the sum is 60.
The spelling of 499227980361 in words is "four hundred ninety-nine billion, two hundred twenty-seven million, nine hundred eighty thousand, three hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •