Base | Representation |
---|---|
bin | 1101001101000000001101… |
… | …0011011101111010010000 |
3 | 1220101211000211010001210101 |
4 | 3103100003103131322100 |
5 | 3400321401443123001 |
6 | 50513012141342144 |
7 | 3025551622425442 |
oct | 323200323357220 |
9 | 56354024101711 |
10 | 14517044895376 |
11 | 469770a426281 |
12 | 1765600b67954 |
13 | 813c4a483c1a |
14 | 3828b32da492 |
15 | 1a294d125a01 |
hex | d34034dde90 |
14517044895376 has 45 divisors (see below), whose sum is σ = 28411027171849. Its totient is φ = 7185893864000.
The previous prime is 14517044895323. The next prime is 14517044895383. The reversal of 14517044895376 is 67359844071541.
The square root of 14517044895376 is 3810124.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 13947804824976 + 569240070400 = 3734676^2 + 754480^2 .
It is a Duffinian number.
It is an unprimeable number.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 1539285381 + ... + 1539294811.
Almost surely, 214517044895376 is an apocalyptic number.
14517044895376 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
14517044895376 is the 3810124-th square number.
It is an amenable number.
14517044895376 is a deficient number, since it is larger than the sum of its proper divisors (13893982276473).
14517044895376 is an frugal number, since it uses more digits than its factorization.
14517044895376 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 19072 (or 9534 counting only the distinct ones).
The product of its (nonzero) digits is 101606400, while the sum is 64.
Multiplying 14517044895376 by its sum of digits (64), we get a square (929090873304064 = 304809922).
The spelling of 14517044895376 in words is "fourteen trillion, five hundred seventeen billion, forty-four million, eight hundred ninety-five thousand, three hundred seventy-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •