Base | Representation |
---|---|
bin | 1100111011010001000110… |
… | …0011001100011100010101 |
3 | 1212022200112111101122000102 |
4 | 3032310101203030130111 |
5 | 3330323333323034031 |
6 | 50121020500223445 |
7 | 2664544031063120 |
oct | 316642143143425 |
9 | 55280474348012 |
10 | 14212341221141 |
11 | 458a4691169a8 |
12 | 171654439ab85 |
13 | 7c12ab00902b |
14 | 371c495d13b7 |
15 | 199a67a457cb |
hex | ced118cc715 |
14212341221141 has 16 divisors (see below), whose sum is σ = 16310041711488. Its totient is φ = 12131498040000.
The previous prime is 14212341221131. The next prime is 14212341221219. The reversal of 14212341221141 is 14112214321241.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 14212341221141 - 214 = 14212341204757 is a prime.
It is a super-3 number, since 3×142123412211413 (a number of 40 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14212341221101) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 10190771 + ... + 11501151.
It is an arithmetic number, because the mean of its divisors is an integer number (1019377606968).
Almost surely, 214212341221141 is an apocalyptic number.
It is an amenable number.
14212341221141 is a deficient number, since it is larger than the sum of its proper divisors (2097700490347).
14212341221141 is a wasteful number, since it uses less digits than its factorization.
14212341221141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1316812.
The product of its digits is 3072, while the sum is 29.
Adding to 14212341221141 its reverse (14112214321241), we get a palindrome (28324555542382).
The spelling of 14212341221141 in words is "fourteen trillion, two hundred twelve billion, three hundred forty-one million, two hundred twenty-one thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •