Base | Representation |
---|---|
bin | 1100110001111111100101… |
… | …0101001011000000100100 |
3 | 1211202110022012111000101100 |
4 | 3030133321111023000210 |
5 | 3320221041400231431 |
6 | 45515511353200100 |
7 | 2650203651315153 |
oct | 314377125130044 |
9 | 54673265430340 |
10 | 14053021102116 |
11 | 4528942061447 |
12 | 16ab6a0400030 |
13 | 7ac26a886159 |
14 | 3682540d959a |
15 | 195840b044e6 |
hex | cc7f954b024 |
14053021102116 has 36 divisors (see below), whose sum is σ = 35523033476112. Its totient is φ = 4684324671984.
The previous prime is 14053021102103. The next prime is 14053021102157. The reversal of 14053021102116 is 61120112035041.
14053021102116 is a `hidden beast` number, since 1 + 4 + 0 + 530 + 2 + 1 + 10 + 2 + 116 = 666.
It is a tau number, because it is divible by the number of its divisors (36).
It is a self number, because there is not a number n which added to its sum of digits gives 14053021102116.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 16164751 + ... + 17011913.
It is an arithmetic number, because the mean of its divisors is an integer number (986750929892).
Almost surely, 214053021102116 is an apocalyptic number.
It is an amenable number.
14053021102116 is an abundant number, since it is smaller than the sum of its proper divisors (21470012373996).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14053021102116 is a wasteful number, since it uses less digits than its factorization.
14053021102116 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1307960 (or 1307955 counting only the distinct ones).
The product of its (nonzero) digits is 1440, while the sum is 27.
Adding to 14053021102116 its reverse (61120112035041), we get a palindrome (75173133137157).
The spelling of 14053021102116 in words is "fourteen trillion, fifty-three billion, twenty-one million, one hundred two thousand, one hundred sixteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •