Base | Representation |
---|---|
bin | 1100110001011111001000… |
… | …1010111011000000000000 |
3 | 1211201121211011222000101011 |
4 | 3030113302022323000000 |
5 | 3320100222111240000 |
6 | 45511511210250304 |
7 | 2646445056105103 |
oct | 314276212730000 |
9 | 54647734860334 |
10 | 14044311040000 |
11 | 45251824a18aa |
12 | 16a9a6b426994 |
13 | 7ab4b01bca47 |
14 | 367a693d873a |
15 | 1954d10ea2ba |
hex | cc5f22bb000 |
14044311040000 has 130 divisors (see below), whose sum is σ = 35095263936260. Its totient is φ = 5617723392000.
The previous prime is 14044311039977. The next prime is 14044311040009. The reversal of 14044311040000 is 4011344041.
It is not an unprimeable number, because it can be changed into a prime (14044311040009) by changing a digit.
It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 183030 + ... + 5303029.
Almost surely, 214044311040000 is an apocalyptic number.
14044311040000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 14044311040000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (17547631968130).
14044311040000 is an abundant number, since it is smaller than the sum of its proper divisors (21050952896260).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14044311040000 is an frugal number, since it uses more digits than its factorization.
14044311040000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5486103 (or 5486066 counting only the distinct ones).
The product of its (nonzero) digits is 768, while the sum is 22.
Adding to 14044311040000 its reverse (4011344041), we get a palindrome (14048322384041).
The spelling of 14044311040000 in words is "fourteen trillion, forty-four billion, three hundred eleven million, forty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •