Base | Representation |
---|---|
bin | 1001011101000100… |
… | …11010100100101000 |
3 | 111002201220100122020 |
4 | 10232202122210220 |
5 | 40343342202333 |
6 | 2155354424440 |
7 | 236532041424 |
oct | 45642324450 |
9 | 14081810566 |
10 | 5075740968 |
11 | 217513a351 |
12 | b97a32120 |
13 | 62b75a52c |
14 | 362179b84 |
15 | 1ea9183b3 |
hex | 12e89a928 |
5075740968 has 64 divisors (see below), whose sum is σ = 12812567040. Its totient is φ = 1675567104.
The previous prime is 5075740963. The next prime is 5075740973. The reversal of 5075740968 is 8690475705.
It is an interprime number because it is at equal distance from previous prime (5075740963) and next prime (5075740973).
It is a self number, because there is not a number n which added to its sum of digits gives 5075740968.
It is not an unprimeable number, because it can be changed into a prime (5075740963) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1076905 + ... + 1081607.
It is an arithmetic number, because the mean of its divisors is an integer number (200196360).
Almost surely, 25075740968 is an apocalyptic number.
It is an amenable number.
5075740968 is an abundant number, since it is smaller than the sum of its proper divisors (7736826072).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5075740968 is a wasteful number, since it uses less digits than its factorization.
5075740968 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5138 (or 5134 counting only the distinct ones).
The product of its (nonzero) digits is 2116800, while the sum is 51.
The square root of 5075740968 is about 71244.2346298983. The cubic root of 5075740968 is about 1718.5670605546.
It can be divided in two parts, 507 and 5740968, that added together give a palindrome (5741475).
The spelling of 5075740968 in words is "five billion, seventy-five million, seven hundred forty thousand, nine hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •