Base | Representation |
---|---|
bin | 11110110000110100010… |
… | …010011000011001110101 |
3 | 21111002121101002222020221 |
4 | 132300310102120121311 |
5 | 234113433243042123 |
6 | 4255054141054341 |
7 | 305505630143455 |
oct | 36606422303165 |
9 | 7432541088227 |
10 | 2114001143413 |
11 | 7455a7596195 |
12 | 2a185a8573b1 |
13 | 124470993253 |
14 | 74465203d65 |
15 | 39ecb4c425d |
hex | 1ec34498675 |
2114001143413 has 4 divisors (see below), whose sum is σ = 2128189070700. Its totient is φ = 2099813216128.
The previous prime is 2114001143411. The next prime is 2114001143417. The reversal of 2114001143413 is 3143411004112.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 831585319569 + 1282415823844 = 911913^2 + 1132438^2 .
It is a cyclic number.
It is not a de Polignac number, because 2114001143413 - 21 = 2114001143411 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 (2114001143411) 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, 7093963420 + ... + 7093963717.
It is an arithmetic number, because the mean of its divisors is an integer number (532047267675).
Almost surely, 22114001143413 is an apocalyptic number.
It is an amenable number.
2114001143413 is a deficient number, since it is larger than the sum of its proper divisors (14187927287).
2114001143413 is a wasteful number, since it uses less digits than its factorization.
2114001143413 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 14187927286.
The product of its (nonzero) digits is 1152, while the sum is 25.
Adding to 2114001143413 its reverse (3143411004112), we get a palindrome (5257412147525).
The spelling of 2114001143413 in words is "two trillion, one hundred fourteen billion, one million, one hundred forty-three thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •