Base | Representation |
---|---|
bin | 1001110111010111… |
… | …01001100000101001 |
3 | 111200002212011002111 |
4 | 10323223221200221 |
5 | 41321320442012 |
6 | 2233313202321 |
7 | 245150340403 |
oct | 47353514051 |
9 | 14602764074 |
10 | 5296265257 |
11 | 2278670528 |
12 | 10398603a1 |
13 | 66534c78a |
14 | 383581b73 |
15 | 20ee78ba7 |
hex | 13bae9829 |
5296265257 has 8 divisors (see below), whose sum is σ = 5575867200. Its totient is φ = 5016748464.
The previous prime is 5296265209. The next prime is 5296265263. The reversal of 5296265257 is 7525626925.
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 5296265257 - 27 = 5296265129 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 5296265257.
It is not an unprimeable number, because it can be changed into a prime (5296265287) 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, 136419 + ... + 170887.
It is an arithmetic number, because the mean of its divisors is an integer number (696983400).
Almost surely, 25296265257 is an apocalyptic number.
It is an amenable number.
5296265257 is a deficient number, since it is larger than the sum of its proper divisors (279601943).
5296265257 is a wasteful number, since it uses less digits than its factorization.
5296265257 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 42575.
The product of its digits is 2268000, while the sum is 49.
The square root of 5296265257 is about 72775.4440522351. Note that the first 3 decimals coincide. The cubic root of 5296265257 is about 1743.1037720469.
The spelling of 5296265257 in words is "five billion, two hundred ninety-six million, two hundred sixty-five thousand, two hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.166 sec. • engine limits •