Base | Representation |
---|---|
bin | 1100110001001100010111… |
… | …1110011010110011100100 |
3 | 1211201010211012000020020121 |
4 | 3030103011332122303210 |
5 | 3320004413244110404 |
6 | 45505315334011324 |
7 | 2646206212050424 |
oct | 314230576326344 |
9 | 54633735006217 |
10 | 14039274597604 |
11 | 4523028564113 |
12 | 16a8aa47a6b44 |
13 | 7aab89941a09 |
14 | 36770c56c484 |
15 | 1952d8d95e54 |
hex | cc4c5f9ace4 |
14039274597604 has 81 divisors (see below), whose sum is σ = 26280917331291. Its totient is φ = 6560975278080.
The previous prime is 14039274597581. The next prime is 14039274597637. The reversal of 14039274597604 is 40679547293041.
It is a happy number.
The square root of 14039274597604 is 3746902.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in 4 ways, for example, as 8556620004 + 14030717977600 = 92502^2 + 3745760^2 .
It is a super-2 number, since 2×140392745976042 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 26 ways as a sum of consecutive naturals, for example, 24587170639 + ... + 24587171209.
Almost surely, 214039274597604 is an apocalyptic number.
14039274597604 is the 3746902-nd square number.
It is an amenable number.
14039274597604 is a deficient number, since it is larger than the sum of its proper divisors (12241642733687).
14039274597604 is an frugal number, since it uses more digits than its factorization.
14039274597604 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1566 (or 783 counting only the distinct ones).
The product of its (nonzero) digits is 45722880, while the sum is 61.
The spelling of 14039274597604 in words is "fourteen trillion, thirty-nine billion, two hundred seventy-four million, five hundred ninety-seven thousand, six hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.060 sec. • engine limits •