Base | Representation |
---|---|
bin | 1100110001110011100111… |
… | …1001001100001101111000 |
3 | 1211202011000100221111220211 |
4 | 3030130321321030031320 |
5 | 3320143002141200101 |
6 | 45514220541400504 |
7 | 2650031241520300 |
oct | 314347171141570 |
9 | 54664010844824 |
10 | 14049809318776 |
11 | 45275440a0050 |
12 | 16aab44869134 |
13 | 7abb7835013a |
14 | 36802b724600 |
15 | 195703b79c51 |
hex | cc739e4c378 |
14049809318776 has 192 divisors, whose sum is σ = 33562235472480. Its totient is φ = 5452371025920.
The previous prime is 14049809318749. The next prime is 14049809318789. The reversal of 14049809318776 is 67781390894041.
It is a super-2 number, since 2×140498093187762 (a number of 27 digits) contains 22 as substring.
It is a congruent 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 47 ways as a sum of consecutive naturals, for example, 1378373136 + ... + 1378383328.
Almost surely, 214049809318776 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 14049809318776, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (16781117736240).
14049809318776 is an abundant number, since it is smaller than the sum of its proper divisors (19512426153704).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14049809318776 is a wasteful number, since it uses less digits than its factorization.
14049809318776 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11454 (or 11443 counting only the distinct ones).
The product of its (nonzero) digits is 73156608, while the sum is 67.
The spelling of 14049809318776 in words is "fourteen trillion, forty-nine billion, eight hundred nine million, three hundred eighteen thousand, seven hundred seventy-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.106 sec. • engine limits •