Base | Representation |
---|---|
bin | 110000101011111000000010… |
… | …011110110010101100111101 |
3 | 1001002010210121102102201000101 |
4 | 300223320002132302230331 |
5 | 211031131001321414323 |
6 | 2035221553003401101 |
7 | 63046520305121245 |
oct | 6053700236625475 |
9 | 1032123542381011 |
10 | 214121341201213 |
11 | 62253394a81406 |
12 | 20022197b23191 |
13 | 926272c22c674 |
14 | 3ac37575a2b25 |
15 | 19b4bc2a70dad |
hex | c2be027b2b3d |
214121341201213 has 8 divisors (see below), whose sum is σ = 216567288026432. Its totient is φ = 211680261933696.
The previous prime is 214121341201211. The next prime is 214121341201237. The reversal of 214121341201213 is 312102143121412.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 214121341201213 - 21 = 214121341201211 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 (214121341201211) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1216800945 + ... + 1216976902.
It is an arithmetic number, because the mean of its divisors is an integer number (27070911003304).
Almost surely, 2214121341201213 is an apocalyptic number.
It is an amenable number.
214121341201213 is a deficient number, since it is larger than the sum of its proper divisors (2445946825219).
214121341201213 is an equidigital number, since it uses as much as digits as its factorization.
214121341201213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2433778851.
The product of its (nonzero) digits is 2304, while the sum is 28.
Adding to 214121341201213 its reverse (312102143121412), we get a palindrome (526223484322625).
The spelling of 214121341201213 in words is "two hundred fourteen trillion, one hundred twenty-one billion, three hundred forty-one million, two hundred one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •