Base | Representation |
---|---|
bin | 1001110100000111… |
… | …01010001111010101 |
3 | 111121012120012102022 |
4 | 10322003222033111 |
5 | 41242331132034 |
6 | 2230501022525 |
7 | 244366543253 |
oct | 47203521725 |
9 | 14535505368 |
10 | 5269005269 |
11 | 2264241710 |
12 | 10306b4a45 |
13 | 65c7c69c8 |
14 | 37dac75d3 |
15 | 20c891b2e |
hex | 13a0ea3d5 |
5269005269 has 16 divisors (see below), whose sum is σ = 5817623040. Its totient is φ = 4732200000.
The previous prime is 5269005221. The next prime is 5269005277. The reversal of 5269005269 is 9625009625.
It is not a de Polignac number, because 5269005269 - 220 = 5267956693 is a prime.
It is a super-2 number, since 2×52690052692 = 55524833049499524722, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5269005289) 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 15 ways as a sum of consecutive naturals, for example, 527219 + ... + 537119.
It is an arithmetic number, because the mean of its divisors is an integer number (363601440).
Almost surely, 25269005269 is an apocalyptic number.
It is an amenable number.
5269005269 is a deficient number, since it is larger than the sum of its proper divisors (548617771).
5269005269 is a wasteful number, since it uses less digits than its factorization.
5269005269 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10492.
The product of its (nonzero) digits is 291600, while the sum is 44.
The square root of 5269005269 is about 72587.9140697678. The cubic root of 5269005269 is about 1740.1080292509.
It can be divided in two parts, 526900 and 5269, that multiplied together give a square (2776236100 = 526902).
The spelling of 5269005269 in words is "five billion, two hundred sixty-nine million, five thousand, two hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •