Base | Representation |
---|---|
bin | 110000011101101001111011… |
… | …001110001010010110110111 |
3 | 1000221200101012210200122211022 |
4 | 300131221323032022112313 |
5 | 210414123121232410203 |
6 | 2033153015424331355 |
7 | 62616103564634525 |
oct | 6035517316122667 |
9 | 1027611183618738 |
10 | 213144114341303 |
11 | 61a06a02987752 |
12 | 1baa4910773b5b |
13 | 91c1533023062 |
14 | 3a8c331873315 |
15 | 199957a756a38 |
hex | c1da7b38a5b7 |
213144114341303 has 4 divisors (see below), whose sum is σ = 213152220864168. Its totient is φ = 213136007818440.
The previous prime is 213144114341293. The next prime is 213144114341357. The reversal of 213144114341303 is 303143411441312.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 213144114341303 - 24 = 213144114341287 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 (213144119341303) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4053221993 + ... + 4053274578.
It is an arithmetic number, because the mean of its divisors is an integer number (53288055216042).
Almost surely, 2213144114341303 is an apocalyptic number.
213144114341303 is a deficient number, since it is larger than the sum of its proper divisors (8106522865).
213144114341303 is an equidigital number, since it uses as much as digits as its factorization.
213144114341303 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8106522864.
The product of its (nonzero) digits is 41472, while the sum is 35.
Adding to 213144114341303 its reverse (303143411441312), we get a palindrome (516287525782615).
The spelling of 213144114341303 in words is "two hundred thirteen trillion, one hundred forty-four billion, one hundred fourteen million, three hundred forty-one thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •