Base | Representation |
---|---|
bin | 11011101110101111… |
… | …11010101011000001 |
3 | 1102102112202111111011 |
4 | 31313113322223001 |
5 | 220442220111400 |
6 | 10501142120521 |
7 | 1034634011134 |
oct | 156727725301 |
9 | 42375674434 |
10 | 14887660225 |
11 | 634a772529 |
12 | 2a75a20141 |
13 | 15334a4a09 |
14 | a1334021b |
15 | 5c20238ba |
hex | 3775faac1 |
14887660225 has 27 divisors (see below), whose sum is σ = 19316440969. Its totient is φ = 11381559200.
The previous prime is 14887660219. The next prime is 14887660231. The reversal of 14887660225 is 52206678841.
The square root of 14887660225 is 122015.
It is a perfect power (a square), and thus also a powerful number.
It is an interprime number because it is at equal distance from previous prime (14887660219) and next prime (14887660231).
It can be written as a sum of positive squares in 4 ways, for example, as 5612161 + 14882048064 = 2369^2 + 121992^2 .
It is a de Polignac number, because none of the positive numbers 2k-14887660225 is a prime.
It is a Duffinian number.
It is an unprimeable number.
It is a polite number, since it can be written in 26 ways as a sum of consecutive naturals, for example, 14031195 + ... + 14032255.
Almost surely, 214887660225 is an apocalyptic number.
14887660225 is the 122015-th square number.
14887660225 is the 61008-th centered octagonal number.
It is an amenable number.
14887660225 is a deficient number, since it is larger than the sum of its proper divisors (4428780744).
14887660225 is an frugal number, since it uses more digits than its factorization.
14887660225 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2178 (or 1089 counting only the distinct ones).
The product of its (nonzero) digits is 1290240, while the sum is 49.
Multiplying 14887660225 by its sum of digits (49), we get a square (729495351025 = 8541052).
The spelling of 14887660225 in words is "fourteen billion, eight hundred eighty-seven million, six hundred sixty thousand, two hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •