Base | Representation |
---|---|
bin | 1101010010011110010000… |
… | …1100010101111010101011 |
3 | 1220201210120120012110112221 |
4 | 3110213210030111322223 |
5 | 3403341323111330233 |
6 | 51024112323214511 |
7 | 3035416334443051 |
oct | 324474414257253 |
9 | 56653516173487 |
10 | 14611012214443 |
11 | 472354a539957 |
12 | 177b866517437 |
13 | 81ca741c4578 |
14 | 3872690821d1 |
15 | 1a50ec91e42d |
hex | d49e4315eab |
14611012214443 has 8 divisors (see below), whose sum is σ = 14613062259200. Its totient is φ = 14608962339048.
The previous prime is 14611012214437. The next prime is 14611012214479. The reversal of 14611012214443 is 34441221011641.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-14611012214443 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 14611012214399 and 14611012214408.
It is not an unprimeable number, because it can be changed into a prime (14611012214423) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 299240530 + ... + 299289352.
It is an arithmetic number, because the mean of its divisors is an integer number (1826632782400).
Almost surely, 214611012214443 is an apocalyptic number.
14611012214443 is a deficient number, since it is larger than the sum of its proper divisors (2050044757).
14611012214443 is a wasteful number, since it uses less digits than its factorization.
14611012214443 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 84681.
The product of its (nonzero) digits is 18432, while the sum is 34.
The spelling of 14611012214443 in words is "fourteen trillion, six hundred eleven billion, twelve million, two hundred fourteen thousand, four hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •