Base | Representation |
---|---|
bin | 1001101011111101… |
… | …11100101101110101 |
3 | 111102102221222012121 |
4 | 10311332330231311 |
5 | 41122332130430 |
6 | 2220020115541 |
7 | 242606615014 |
oct | 46576745565 |
9 | 14372858177 |
10 | 5200661365 |
11 | 2229701949 |
12 | 1011835bb1 |
13 | 64b5b7c23 |
14 | 3749b6a7b |
15 | 206891a7a |
hex | 135fbcb75 |
5200661365 has 4 divisors (see below), whose sum is σ = 6240793644. Its totient is φ = 4160529088.
The previous prime is 5200661363. The next prime is 5200661381. The reversal of 5200661365 is 5631660025.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 2224631556 + 2976029809 = 47166^2 + 54553^2 .
It is a cyclic number.
It is not a de Polignac number, because 5200661365 - 21 = 5200661363 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 5200661365.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5200661363) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 520066132 + ... + 520066141.
It is an arithmetic number, because the mean of its divisors is an integer number (1560198411).
Almost surely, 25200661365 is an apocalyptic number.
It is an amenable number.
5200661365 is a deficient number, since it is larger than the sum of its proper divisors (1040132279).
5200661365 is a wasteful number, since it uses less digits than its factorization.
5200661365 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1040132278.
The product of its (nonzero) digits is 32400, while the sum is 34.
The square root of 5200661365 is about 72115.6111046700. The cubic root of 5200661365 is about 1732.5516563151.
The spelling of 5200661365 in words is "five billion, two hundred million, six hundred sixty-one thousand, three hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.023 sec. • engine limits •