Base | Representation |
---|---|
bin | 1010100111011010… |
… | …01001001111001100 |
3 | 112201012020222021120 |
4 | 11103231021033030 |
5 | 43133010414130 |
6 | 2341312000540 |
7 | 261143224500 |
oct | 52355111714 |
9 | 15635228246 |
10 | 5699310540 |
11 | 2465126400 |
12 | 1130830150 |
13 | 6ca9b9201 |
14 | 3c0cda300 |
15 | 23553e910 |
hex | 153b493cc |
5699310540 has 432 divisors, whose sum is σ = 21004343136. Its totient is φ = 1149603840.
The previous prime is 5699310527. The next prime is 5699310557. The reversal of 5699310540 is 450139965.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is a junction number, because it is equal to n+sod(n) for n = 5699310492 and 5699310501.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 143 ways as a sum of consecutive naturals, for example, 13162164 + ... + 13162596.
Almost surely, 25699310540 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 5699310540, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (10502171568).
5699310540 is an abundant number, since it is smaller than the sum of its proper divisors (15305032596).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5699310540 is a wasteful number, since it uses less digits than its factorization.
5699310540 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 518 (or 498 counting only the distinct ones).
The product of its (nonzero) digits is 145800, while the sum is 42.
The square root of 5699310540 is about 75493.7781542294. The cubic root of 5699310540 is about 1786.2439617969.
The spelling of 5699310540 in words is "five billion, six hundred ninety-nine million, three hundred ten thousand, five hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •