Base | Representation |
---|---|
bin | 1001100001100011… |
… | …00100111010000000 |
3 | 111012100112000122020 |
4 | 10300301210322000 |
5 | 40432444114023 |
6 | 2203215041440 |
7 | 240466035246 |
oct | 46061447200 |
9 | 14170460566 |
10 | 5113269888 |
11 | 2194342391 |
12 | ba8510280 |
13 | 63646a3ac |
14 | 367148796 |
15 | 1edd7cde3 |
hex | 130c64e80 |
5113269888 has 64 divisors (see below), whose sum is σ = 13702435200. Its totient is φ = 1689325568.
The previous prime is 5113269857. The next prime is 5113269899. The reversal of 5113269888 is 8889623115.
It is a tau number, because it is divible by the number of its divisors (64).
It is a super-2 number, since 2×51132698882 = 52291057895055065088, which contains 22 as substring.
It is a Smith number, since the sum of its digits (51) coincides with the sum of the digits of its prime factors.
It is a self number, because there is not a number n which added to its sum of digits gives 5113269888.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 15528 + ... + 102311.
It is an arithmetic number, because the mean of its divisors is an integer number (214100550).
Almost surely, 25113269888 is an apocalyptic number.
It is an amenable number.
5113269888 is an abundant number, since it is smaller than the sum of its proper divisors (8589165312).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5113269888 is a wasteful number, since it uses less digits than its factorization.
5113269888 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 117969 (or 117957 counting only the distinct ones).
The product of its digits is 829440, while the sum is 51.
The square root of 5113269888 is about 71507.1317282409. The cubic root of 5113269888 is about 1722.7922340818.
The spelling of 5113269888 in words is "five billion, one hundred thirteen million, two hundred sixty-nine thousand, eight hundred eighty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •