Base | Representation |
---|---|
bin | 11101100001100011000… |
… | …10010010110011001101 |
3 | 10120222110022010220020202 |
4 | 32300301202102303031 |
5 | 113110034444332331 |
6 | 2054010121423245 |
7 | 133201565150513 |
oct | 16606142226315 |
9 | 3528408126222 |
10 | 1014443355341 |
11 | 36124a9115a9 |
12 | 14473303ab25 |
13 | 7487a6b8b50 |
14 | 3715676c4b3 |
15 | 1b5c4773ecb |
hex | ec31892ccd |
1014443355341 has 16 divisors (see below), whose sum is σ = 1093334022144. Its totient is φ = 935675399424.
The previous prime is 1014443355329. The next prime is 1014443355361. The reversal of 1014443355341 is 1435533444101.
It is a cyclic number.
It is not a de Polignac number, because 1014443355341 - 238 = 739565448397 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1014443355295 and 1014443355304.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1014443355361) 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 15 ways as a sum of consecutive naturals, for example, 129670556 + ... + 129678378.
It is an arithmetic number, because the mean of its divisors is an integer number (68333376384).
Almost surely, 21014443355341 is an apocalyptic number.
It is an amenable number.
1014443355341 is a deficient number, since it is larger than the sum of its proper divisors (78890666803).
1014443355341 is a wasteful number, since it uses less digits than its factorization.
1014443355341 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14380.
The product of its (nonzero) digits is 172800, while the sum is 38.
Adding to 1014443355341 its reverse (1435533444101), we get a palindrome (2449976799442).
The spelling of 1014443355341 in words is "one trillion, fourteen billion, four hundred forty-three million, three hundred fifty-five thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •