Base | Representation |
---|---|
bin | 11101110010001… |
… | …110100000000000 |
3 | 1021211021200120022 |
4 | 131302032200000 |
5 | 2010411041411 |
6 | 121330233012 |
7 | 15245300246 |
oct | 3562164000 |
9 | 1254250508 |
10 | 499705856 |
11 | 237086451 |
12 | 11b425768 |
13 | 7c6b1250 |
14 | 4a51a796 |
15 | 2dd0aedb |
hex | 1dc8e800 |
499705856 has 72 divisors (see below), whose sum is σ = 1083938310. Its totient is φ = 228950016.
The previous prime is 499705841. The next prime is 499705867. The reversal of 499705856 is 658507994.
It can be written as a sum of positive squares in 3 ways, for example, as 384787456 + 114918400 = 19616^2 + 10720^2 .
It is a junction number, because it is equal to n+sod(n) for n = 499705798 and 499705807.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 3647420 + ... + 3647556.
Almost surely, 2499705856 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 499705856, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (541969155).
499705856 is an abundant number, since it is smaller than the sum of its proper divisors (584232454).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
499705856 is an equidigital number, since it uses as much as digits as its factorization.
499705856 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 309 (or 152 counting only the distinct ones).
The product of its (nonzero) digits is 2721600, while the sum is 53.
The square root of 499705856 is about 22354.1015475908. The cubic root of 499705856 is about 793.5448539551.
The spelling of 499705856 in words is "four hundred ninety-nine million, seven hundred five thousand, eight hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •