Base | Representation |
---|---|
bin | 1001101011011100… |
… | …01011100101001001 |
3 | 111102010200122121221 |
4 | 10311232023211021 |
5 | 41120221001201 |
6 | 2215342002041 |
7 | 242524346656 |
oct | 46556134511 |
9 | 14363618557 |
10 | 5196265801 |
11 | 222717a451 |
12 | 1010276321 |
13 | 64a7092bc |
14 | 374190c2d |
15 | 2062c44a1 |
hex | 135b8b949 |
5196265801 has 8 divisors (see below), whose sum is σ = 5281894440. Its totient is φ = 5111242752.
The previous prime is 5196265799. The next prime is 5196265819. The reversal of 5196265801 is 1085626915.
It can be written as a sum of positive squares in 4 ways, for example, as 782656576 + 4413609225 = 27976^2 + 66435^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 5196265801 - 21 = 5196265799 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5196265861) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 134080 + ... + 168433.
It is an arithmetic number, because the mean of its divisors is an integer number (660236805).
Almost surely, 25196265801 is an apocalyptic number.
It is an amenable number.
5196265801 is a deficient number, since it is larger than the sum of its proper divisors (85628639).
5196265801 is a wasteful number, since it uses less digits than its factorization.
5196265801 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 302795.
The product of its (nonzero) digits is 129600, while the sum is 43.
The square root of 5196265801 is about 72085.1288477728. The cubic root of 5196265801 is about 1732.0634050654.
The spelling of 5196265801 in words is "five billion, one hundred ninety-six million, two hundred sixty-five thousand, eight hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •