Base | Representation |
---|---|
bin | 11010110000100100… |
… | …00110000000111101 |
3 | 1101002012020110020012 |
4 | 31120102012000331 |
5 | 213410201241000 |
6 | 10333310033005 |
7 | 1016001216623 |
oct | 153022060075 |
9 | 41065213205 |
10 | 14366040125 |
11 | 6102289638 |
12 | 294b1a8765 |
13 | 147c3bcc78 |
14 | 9a3d5b513 |
15 | 591339735 |
hex | 35848603d |
14366040125 has 48 divisors (see below), whose sum is σ = 19015002864. Its totient is φ = 10834560000.
The previous prime is 14366040083. The next prime is 14366040167. The reversal of 14366040125 is 52104066341.
It is an interprime number because it is at equal distance from previous prime (14366040083) and next prime (14366040167).
It can be written as a sum of positive squares in 8 ways, for example, as 676572121 + 13689468004 = 26011^2 + 117002^2 .
It is not a de Polignac number, because 14366040125 - 212 = 14366036029 is a prime.
It is a super-2 number, since 2×143660401252 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 14366040091 and 14366040100.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 10874465 + ... + 10875785.
It is an arithmetic number, because the mean of its divisors is an integer number (396145893).
Almost surely, 214366040125 is an apocalyptic number.
It is an amenable number.
14366040125 is a deficient number, since it is larger than the sum of its proper divisors (4648962739).
14366040125 is a wasteful number, since it uses less digits than its factorization.
14366040125 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1615 (or 1586 counting only the distinct ones).
The product of its (nonzero) digits is 17280, while the sum is 32.
The spelling of 14366040125 in words is "fourteen billion, three hundred sixty-six million, forty thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •