Base | Representation |
---|---|
bin | 1010011110000100… |
… | …11010000001000000 |
3 | 112111201220021221211 |
4 | 11033002122001000 |
5 | 43002433420313 |
6 | 2325433255504 |
7 | 256202460610 |
oct | 51702320100 |
9 | 15451807854 |
10 | 5620998208 |
11 | 24249a8171 |
12 | 110a564594 |
13 | 6b76ca057 |
14 | 3b4752a40 |
15 | 22d720e3d |
hex | 14f09a040 |
5620998208 has 56 divisors (see below), whose sum is σ = 12840809472. Its totient is φ = 2391389184.
The previous prime is 5620998191. The next prime is 5620998217. The reversal of 5620998208 is 8028990265.
It is a tau number, because it is divible by the number of its divisors (56).
It is a super-2 number, since 2×56209982082 = 63191241708678422528, which contains 22 as substring.
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 7 ways as a sum of consecutive naturals, for example, 15585 + ... + 107167.
Almost surely, 25620998208 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 5620998208, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (6420404736).
5620998208 is an abundant number, since it is smaller than the sum of its proper divisors (7219811264).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5620998208 is a wasteful number, since it uses less digits than its factorization.
5620998208 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 91739 (or 91729 counting only the distinct ones).
The product of its (nonzero) digits is 622080, while the sum is 49.
The square root of 5620998208 is about 74973.3166399887. The cubic root of 5620998208 is about 1778.0248056083.
The spelling of 5620998208 in words is "five billion, six hundred twenty million, nine hundred ninety-eight thousand, two hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •