Base | Representation |
---|---|
bin | 1001111011011101… |
… | …11010110010101001 |
3 | 111202111121102222222 |
4 | 10331232322302221 |
5 | 41404123130110 |
6 | 2240542523425 |
7 | 246046002041 |
oct | 47556726251 |
9 | 14674542888 |
10 | 5330676905 |
11 | 2296034504 |
12 | 1049296575 |
13 | 66c50a7b8 |
14 | 387d7c721 |
15 | 212ec4c55 |
hex | 13dbbaca9 |
5330676905 has 8 divisors (see below), whose sum is σ = 6617392200. Its totient is φ = 4117488256.
The previous prime is 5330676881. The next prime is 5330676929. The reversal of 5330676905 is 5096760335.
It is an interprime number because it is at equal distance from previous prime (5330676881) and next prime (5330676929).
It can be written as a sum of positive squares in 4 ways, for example, as 743053081 + 4587623824 = 27259^2 + 67732^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 5330676905 - 210 = 5330675881 is a prime.
It is a super-2 number, since 2×53306769052 = 56832232531000758050, which contains 22 as substring.
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, 18381500 + ... + 18381789.
It is an arithmetic number, because the mean of its divisors is an integer number (827174025).
Almost surely, 25330676905 is an apocalyptic number.
It is an amenable number.
5330676905 is a deficient number, since it is larger than the sum of its proper divisors (1286715295).
5330676905 is a wasteful number, since it uses less digits than its factorization.
5330676905 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 36763323.
The product of its (nonzero) digits is 510300, while the sum is 44.
The square root of 5330676905 is about 73011.4847472642. The cubic root of 5330676905 is about 1746.8708058117.
The spelling of 5330676905 in words is "five billion, three hundred thirty million, six hundred seventy-six thousand, nine hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •