Base | Representation |
---|---|
bin | 10100101000010000011… |
… | …000100100100110010000 |
3 | 12000112002221222222221201 |
4 | 110220100120210212100 |
5 | 141211233201200441 |
6 | 3003124245400544 |
7 | 204263540621041 |
oct | 24502030444620 |
9 | 5015087888851 |
10 | 1417614084496 |
11 | 4a7230214715 |
12 | 1aa8b0109154 |
13 | a38acbb788c |
14 | 4c881a9a8c8 |
15 | 26d1e6d7c31 |
hex | 14a10624990 |
1417614084496 has 15 divisors (see below), whose sum is σ = 2746636516171. Its totient is φ = 708804660976.
The previous prime is 1417614084493. The next prime is 1417614084529. The reversal of 1417614084496 is 6944804167141.
The square root of 1417614084496 is 1190636.
It is a perfect power (a square), and thus also a powerful number.
It is a super-2 number, since 2×14176140844962 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1417614084493) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 2 ways as a sum of consecutive naturals, for example, 4613715 + ... + 4911373.
Almost surely, 21417614084496 is an apocalyptic number.
1417614084496 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
1417614084496 is the 1190636-th square number.
It is an amenable number.
1417614084496 is a deficient number, since it is larger than the sum of its proper divisors (1329022431675).
1417614084496 is an frugal number, since it uses more digits than its factorization.
1417614084496 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 595326 (or 297661 counting only the distinct ones).
The product of its (nonzero) digits is 4644864, while the sum is 55.
The spelling of 1417614084496 in words is "one trillion, four hundred seventeen billion, six hundred fourteen million, eighty-four thousand, four hundred ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •