Base | Representation |
---|---|
bin | 110000101011111000000110… |
… | …101001110110110001001010 |
3 | 1001002010210210022011112110001 |
4 | 300223320012221312301022 |
5 | 211031131122232212224 |
6 | 2035222003544113214 |
7 | 63046522115153356 |
oct | 6053700651666112 |
9 | 1032123708145401 |
10 | 214121411210314 |
11 | 62253420549273 |
12 | 200221b746580a |
13 | 92627408a237a |
14 | 3ac37629c8466 |
15 | 19b4bc8c9e544 |
hex | c2be06a76c4a |
214121411210314 has 8 divisors (see below), whose sum is σ = 329015826981828. Its totient is φ = 104449468883040.
The previous prime is 214121411210309. The next prime is 214121411210353. The reversal of 214121411210314 is 413012114121412.
It can be written as a sum of positive squares in 2 ways, for example, as 204818087692089 + 9303323518225 = 14311467^2 + 3050135^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 1305618360957 + ... + 1305618361120.
Almost surely, 2214121411210314 is an apocalyptic number.
214121411210314 is a deficient number, since it is larger than the sum of its proper divisors (114894415771514).
214121411210314 is a wasteful number, since it uses less digits than its factorization.
214121411210314 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2611236722120.
The product of its (nonzero) digits is 1536, while the sum is 28.
Adding to 214121411210314 its reverse (413012114121412), we get a palindrome (627133525331726).
It can be divided in two parts, 2141214 and 11210314, that added together give a triangular number (13351528 = T5167).
The spelling of 214121411210314 in words is "two hundred fourteen trillion, one hundred twenty-one billion, four hundred eleven million, two hundred ten thousand, three hundred fourteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •