Base | Representation |
---|---|
bin | 1101001000100101010011… |
… | …0001001000001101110011 |
3 | 1220010120000020120010121200 |
4 | 3102021110301020031303 |
5 | 3343100334131322003 |
6 | 50414052322222243 |
7 | 3020222655326223 |
oct | 322112461101563 |
9 | 56116006503550 |
10 | 14441102214003 |
11 | 46684897a2793 |
12 | 1752947ab4983 |
13 | 809a36abc17a |
14 | 37cd4b356083 |
15 | 1a09a5e506a3 |
hex | d2254c48373 |
14441102214003 has 6 divisors (see below), whose sum is σ = 20859369864684. Its totient is φ = 9627401475996.
The previous prime is 14441102213981. The next prime is 14441102214031. The reversal of 14441102214003 is 30041220114441.
14441102214003 is a `hidden beast` number, since 1 + 4 + 441 + 1 + 0 + 2 + 214 + 0 + 0 + 3 = 666.
It is not a de Polignac number, because 14441102214003 - 29 = 14441102213491 is a prime.
It is not an unprimeable number, because it can be changed into a prime (14441102214053) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 802283456325 + ... + 802283456342.
It is an arithmetic number, because the mean of its divisors is an integer number (3476561644114).
Almost surely, 214441102214003 is an apocalyptic number.
14441102214003 is a deficient number, since it is larger than the sum of its proper divisors (6418267650681).
14441102214003 is a wasteful number, since it uses less digits than its factorization.
14441102214003 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1604566912673 (or 1604566912670 counting only the distinct ones).
The product of its (nonzero) digits is 3072, while the sum is 27.
Adding to 14441102214003 its reverse (30041220114441), we get a palindrome (44482322328444).
The spelling of 14441102214003 in words is "fourteen trillion, four hundred forty-one billion, one hundred two million, two hundred fourteen thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •