Base | Representation |
---|---|
bin | 1001110011011001… |
… | …10000111111101001 |
3 | 111120210021021201012 |
4 | 10321230300333221 |
5 | 41234312104000 |
6 | 2230124233305 |
7 | 244264535615 |
oct | 47154607751 |
9 | 14523237635 |
10 | 5263003625 |
11 | 2260912580 |
12 | 102a69b835 |
13 | 65b4a5039 |
14 | 37cda4345 |
15 | 20c0a8735 |
hex | 139b30fe9 |
5263003625 has 16 divisors (see below), whose sum is σ = 7165342080. Its totient is φ = 3827638000.
The previous prime is 5263003597. The next prime is 5263003709.
5263003625 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 5263003625 - 212 = 5262999529 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 5263003591 and 5263003600.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 1912445 + ... + 1915194.
It is an arithmetic number, because the mean of its divisors is an integer number (447833880).
Almost surely, 25263003625 is an apocalyptic number.
5263003625 is a gapful number since it is divisible by the number (55) formed by its first and last digit.
It is an amenable number.
5263003625 is a deficient number, since it is larger than the sum of its proper divisors (1902338455).
5263003625 is a wasteful number, since it uses less digits than its factorization.
5263003625 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3827665 (or 3827655 counting only the distinct ones).
The product of its (nonzero) digits is 32400, while the sum is 32.
The square root of 5263003625 is about 72546.5617724231. The cubic root of 5263003625 is about 1739.4470900345.
It can be divided in two parts, 526300 and 3625, that added together give a palindrome (529925).
The spelling of 5263003625 in words is "five billion, two hundred sixty-three million, three thousand, six hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •