Base | Representation |
---|---|
bin | 1001111011011010… |
… | …01000111110010011 |
3 | 111202110201202111101 |
4 | 10331231020332103 |
5 | 41404013220312 |
6 | 2240524525231 |
7 | 246042020623 |
oct | 47555107623 |
9 | 14673652441 |
10 | 5330210707 |
11 | 2295846218 |
12 | 10490b0817 |
13 | 66c3a6543 |
14 | 387c9a883 |
15 | 212e31a57 |
hex | 13db48f93 |
5330210707 has 4 divisors (see below), whose sum is σ = 5330698776. Its totient is φ = 5329722640.
The previous prime is 5330210653. The next prime is 5330210729. The reversal of 5330210707 is 7070120335.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 5330210707 - 211 = 5330208659 is a prime.
It is a super-2 number, since 2×53302107072 = 56822292362034879698, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5330210777) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 227269 + ... + 249622.
It is an arithmetic number, because the mean of its divisors is an integer number (1332674694).
Almost surely, 25330210707 is an apocalyptic number.
5330210707 is a deficient number, since it is larger than the sum of its proper divisors (488069).
5330210707 is a wasteful number, since it uses less digits than its factorization.
5330210707 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 488068.
The product of its (nonzero) digits is 4410, while the sum is 28.
The square root of 5330210707 is about 73008.2920427536. The cubic root of 5330210707 is about 1746.8198797328.
It can be divided in two parts, 53302 and 10707, that added together give a square (64009 = 2532).
The spelling of 5330210707 in words is "five billion, three hundred thirty million, two hundred ten thousand, seven hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •