Base | Representation |
---|---|
bin | 110000101100001100010011… |
… | …011010110011000000001111 |
3 | 1001002012212202211211112010022 |
4 | 300230030103122303000033 |
5 | 211032010032122444043 |
6 | 2035235552050332355 |
7 | 63051220436436305 |
oct | 6054142332630017 |
9 | 1032185684745108 |
10 | 214143100203023 |
11 | 62261640402532 |
12 | 2002644ab8a0bb |
13 | 92647b9171374 |
14 | 3ac481d32c275 |
15 | 19b5547e47868 |
hex | c2c3136b300f |
214143100203023 has 32 divisors (see below), whose sum is σ = 243272278609920. Its totient is φ = 187426749888000.
The previous prime is 214143100202959. The next prime is 214143100203029. The reversal of 214143100203023 is 320302001341412.
It is a cyclic number.
It is not a de Polignac number, because 214143100203023 - 26 = 214143100202959 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 214143100202983 and 214143100203001.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (214143100203029) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 29978723 + ... + 36428148.
It is an arithmetic number, because the mean of its divisors is an integer number (7602258706560).
Almost surely, 2214143100203023 is an apocalyptic number.
214143100203023 is a deficient number, since it is larger than the sum of its proper divisors (29129178406897).
214143100203023 is a wasteful number, since it uses less digits than its factorization.
214143100203023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 66407159.
The product of its (nonzero) digits is 3456, while the sum is 26.
Adding to 214143100203023 its reverse (320302001341412), we get a palindrome (534445101544435).
The spelling of 214143100203023 in words is "two hundred fourteen trillion, one hundred forty-three billion, one hundred million, two hundred three thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •