Base | Representation |
---|---|
bin | 1011001101100001… |
… | …11000001100100000 |
3 | 120112110220202011102 |
4 | 11212300320030200 |
5 | 44311334301131 |
6 | 2433133133532 |
7 | 302105064302 |
oct | 54660701440 |
9 | 16473822142 |
10 | 6019056416 |
11 | 260966719a |
12 | 11bb92a2a8 |
13 | 74c00b859 |
14 | 41156d972 |
15 | 25364e1cb |
hex | 166c38320 |
6019056416 has 96 divisors (see below), whose sum is σ = 12347209728. Its totient is φ = 2886819840.
The previous prime is 6019056391. The next prime is 6019056443. The reversal of 6019056416 is 6146509106.
It is a self number, because there is not a number n which added to its sum of digits gives 6019056416.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 15715361 + ... + 15715743.
It is an arithmetic number, because the mean of its divisors is an integer number (128616768).
Almost surely, 26019056416 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 6019056416, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (6173604864).
6019056416 is an abundant number, since it is smaller than the sum of its proper divisors (6328153312).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
6019056416 is a wasteful number, since it uses less digits than its factorization.
6019056416 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 634 (or 626 counting only the distinct ones).
The product of its (nonzero) digits is 38880, while the sum is 38.
The square root of 6019056416 is about 77582.5780443006. The cubic root of 6019056416 is about 1819.0423267424.
The spelling of 6019056416 in words is "six billion, nineteen million, fifty-six thousand, four hundred sixteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •