Base | Representation |
---|---|
bin | 1100110111001000000111… |
… | …1111000100100110100111 |
3 | 1212001212221110100101102211 |
4 | 3031302001333010212213 |
5 | 3323142201030230343 |
6 | 50024214510344251 |
7 | 2656445305234321 |
oct | 315620177044647 |
9 | 55055843311384 |
10 | 14141213133223 |
11 | 4562289175770 |
12 | 17047b37bb087 |
13 | 7b7683c58147 |
14 | 36c61cc48611 |
15 | 197ca33a179d |
hex | cdc81fc49a7 |
14141213133223 has 8 divisors (see below), whose sum is σ = 15426844263936. Its totient is φ = 12855593052600.
The previous prime is 14141213133209. The next prime is 14141213133241. The reversal of 14141213133223 is 32233131214141.
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-14141213133223 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14141213133253) 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, 36618 + ... + 5318248.
It is an arithmetic number, because the mean of its divisors is an integer number (1928355532992).
Almost surely, 214141213133223 is an apocalyptic number.
14141213133223 is a deficient number, since it is larger than the sum of its proper divisors (1285631130713).
14141213133223 is a wasteful number, since it uses less digits than its factorization.
14141213133223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5525045.
The product of its digits is 10368, while the sum is 31.
Adding to 14141213133223 its reverse (32233131214141), we get a palindrome (46374344347364).
The spelling of 14141213133223 in words is "fourteen trillion, one hundred forty-one billion, two hundred thirteen million, one hundred thirty-three thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •