Base | Representation |
---|---|
bin | 11110110001000110001… |
… | …011100000011100001101 |
3 | 21111010101021222002111121 |
4 | 132301012023200130031 |
5 | 234120042120044323 |
6 | 4255144023120541 |
7 | 305516233534531 |
oct | 36610613403415 |
9 | 7433337862447 |
10 | 2114301331213 |
11 | 745740a88785 |
12 | 2a19232a3151 |
13 | 1244bac28676 |
14 | 74493025bc1 |
15 | 39ee7a1da5d |
hex | 1ec462e070d |
2114301331213 has 8 divisors (see below), whose sum is σ = 2122005206016. Its totient is φ = 2106608829600.
The previous prime is 2114301331201. The next prime is 2114301331217. The reversal of 2114301331213 is 3121331034112.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2114301331213 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 (2114301331217) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2470728 + ... + 3214513.
It is an arithmetic number, because the mean of its divisors is an integer number (265250650752).
Almost surely, 22114301331213 is an apocalyptic number.
It is an amenable number.
2114301331213 is a deficient number, since it is larger than the sum of its proper divisors (7703874803).
2114301331213 is an equidigital number, since it uses as much as digits as its factorization.
2114301331213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5686595.
The product of its (nonzero) digits is 1296, while the sum is 25.
Adding to 2114301331213 its reverse (3121331034112), we get a palindrome (5235632365325).
The spelling of 2114301331213 in words is "two trillion, one hundred fourteen billion, three hundred one million, three hundred thirty-one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •