Base | Representation |
---|---|
bin | 1001010110100000… |
… | …10101111100011000 |
3 | 110221220021112220020 |
4 | 10223100111330120 |
5 | 40240242444033 |
6 | 2150110230440 |
7 | 235263002010 |
oct | 45320257430 |
9 | 13856245806 |
10 | 5020671768 |
11 | 2147047012 |
12 | b814b5420 |
13 | 6202189c8 |
14 | 358b22c40 |
15 | 1e5b8b6b3 |
hex | 12b415f18 |
5020671768 has 96 divisors (see below), whose sum is σ = 14621913600. Its totient is φ = 1407279744.
The previous prime is 5020671767. The next prime is 5020671797. The reversal of 5020671768 is 8671760205.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5020671763) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 466593 + ... + 477231.
It is an arithmetic number, because the mean of its divisors is an integer number (152311600).
Almost surely, 25020671768 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 5020671768, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (7310956800).
5020671768 is an abundant number, since it is smaller than the sum of its proper divisors (9601241832).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5020671768 is a wasteful number, since it uses less digits than its factorization.
5020671768 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10761 (or 10704 counting only the distinct ones).
The product of its (nonzero) digits is 141120, while the sum is 42.
The square root of 5020671768 is about 70856.6988223414. The cubic root of 5020671768 is about 1712.3292549177.
The spelling of 5020671768 in words is "five billion, twenty million, six hundred seventy-one thousand, seven hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •