Base | Representation |
---|---|
bin | 1001100001101000… |
… | …10100101000111101 |
3 | 111012101212121000200 |
4 | 10300310110220331 |
5 | 40433140132233 |
6 | 2203242314113 |
7 | 240505123641 |
oct | 46064245075 |
9 | 14171777020 |
10 | 5113989693 |
11 | 219479416a |
12 | ba87b8939 |
13 | 63665cc07 |
14 | 367294c21 |
15 | 1ede71313 |
hex | 130d14a3d |
5113989693 has 12 divisors (see below), whose sum is σ = 7394179260. Its totient is φ = 3405954816.
The previous prime is 5113989619. The next prime is 5113989697. The reversal of 5113989693 is 3969893115.
5113989693 is a `hidden beast` number, since 511 + 39 + 8 + 9 + 6 + 93 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 1465588089 + 3648401604 = 38283^2 + 60402^2 .
It is not a de Polignac number, because 5113989693 - 210 = 5113988669 is a prime.
It is a super-2 number, since 2×51139896932 = 52305781160220468498, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5113989697) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 271348 + ... + 289581.
It is an arithmetic number, because the mean of its divisors is an integer number (616181605).
Almost surely, 25113989693 is an apocalyptic number.
It is an amenable number.
5113989693 is a deficient number, since it is larger than the sum of its proper divisors (2280189567).
5113989693 is a wasteful number, since it uses less digits than its factorization.
5113989693 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 561948 (or 561945 counting only the distinct ones).
The product of its digits is 1574640, while the sum is 54.
The square root of 5113989693 is about 71512.1646504984. The cubic root of 5113989693 is about 1722.8730705659.
The spelling of 5113989693 in words is "five billion, one hundred thirteen million, nine hundred eighty-nine thousand, six hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •