Base | Representation |
---|---|
bin | 1001101000100011… |
… | …11000110110110000 |
3 | 111100110011110202220 |
4 | 10310101320312300 |
5 | 41043022244411 |
6 | 2213115241040 |
7 | 242111612460 |
oct | 46421706660 |
9 | 14313143686 |
10 | 5172071856 |
11 | 2214555156 |
12 | 1004149180 |
13 | 6456b7c63 |
14 | 370c93ba0 |
15 | 2040e5b06 |
hex | 134478db0 |
5172071856 has 160 divisors (see below), whose sum is σ = 15541862400. Its totient is φ = 1451623680.
The previous prime is 5172071831. The next prime is 5172071867. The reversal of 5172071856 is 6581702715.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 7193065 + ... + 7193783.
It is an arithmetic number, because the mean of its divisors is an integer number (97136640).
Almost surely, 25172071856 is an apocalyptic number.
5172071856 is a gapful number since it is divisible by the number (56) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 5172071856, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (7770931200).
5172071856 is an abundant number, since it is smaller than the sum of its proper divisors (10369790544).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5172071856 is a wasteful number, since it uses less digits than its factorization.
5172071856 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1087 (or 1081 counting only the distinct ones).
The product of its (nonzero) digits is 117600, while the sum is 42.
The square root of 5172071856 is about 71917.1179622765. The cubic root of 5172071856 is about 1729.3710451587.
The spelling of 5172071856 in words is "five billion, one hundred seventy-two million, seventy-one thousand, eight hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •