Base | Representation |
---|---|
bin | 1100110000000100010001… |
… | …1010111110011000110110 |
3 | 1211122021212102010112222020 |
4 | 3030001010122332120312 |
5 | 3314200244310113433 |
6 | 45452355103014010 |
7 | 2644622500510164 |
oct | 314010432763066 |
9 | 54567772115866 |
10 | 14019921176118 |
11 | 45158a7007100 |
12 | 16a51a329a306 |
13 | 7a90c41c0920 |
14 | 3667d40b6234 |
15 | 194a54c98cb3 |
hex | cc0446be636 |
14019921176118 has 192 divisors, whose sum is σ = 36671918040576. Its totient is φ = 3530492697600.
The previous prime is 14019921176111. The next prime is 14019921176143. The reversal of 14019921176118 is 81167112991041.
It is a Harshad number since it is a multiple of its sum of digits (51).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14019921176111) by changing a digit.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 1790673 + ... + 5589843.
It is an arithmetic number, because the mean of its divisors is an integer number (190999573128).
Almost surely, 214019921176118 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 14019921176118, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (18335959020288).
14019921176118 is an abundant number, since it is smaller than the sum of its proper divisors (22651996864458).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14019921176118 is a wasteful number, since it uses less digits than its factorization.
14019921176118 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3799251 (or 3799240 counting only the distinct ones).
The product of its (nonzero) digits is 217728, while the sum is 51.
The spelling of 14019921176118 in words is "fourteen trillion, nineteen billion, nine hundred twenty-one million, one hundred seventy-six thousand, one hundred eighteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.111 sec. • engine limits •