Base | Representation |
---|---|
bin | 11110110000110101000… |
… | …011110110101001010101 |
3 | 21111002122021111212021121 |
4 | 132300311003312221111 |
5 | 234114000103043331 |
6 | 4255055323043541 |
7 | 305506145316655 |
oct | 36606503665125 |
9 | 7432567455247 |
10 | 2114014112341 |
11 | 745603943a0a |
12 | 2a18630705b1 |
13 | 124473584281 |
14 | 74466c1c365 |
15 | 39ecc6d6c11 |
hex | 1ec350f6a55 |
2114014112341 has 8 divisors (see below), whose sum is σ = 2116310232344. Its totient is φ = 2111718435840.
The previous prime is 2114014112303. The next prime is 2114014112347. The reversal of 2114014112341 is 1432114104112.
It can be written as a sum of positive squares in 4 ways, for example, as 370703193316 + 1743310919025 = 608854^2 + 1320345^2 .
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 2114014112341 - 29 = 2114014111829 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 (2114014112347) 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, 9917701 + ... + 10128613.
It is an arithmetic number, because the mean of its divisors is an integer number (264538779043).
Almost surely, 22114014112341 is an apocalyptic number.
It is an amenable number.
2114014112341 is a deficient number, since it is larger than the sum of its proper divisors (2296120003).
2114014112341 is a wasteful number, since it uses less digits than its factorization.
2114014112341 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 221751.
The product of its (nonzero) digits is 768, while the sum is 25.
Adding to 2114014112341 its reverse (1432114104112), we get a palindrome (3546128216453).
The spelling of 2114014112341 in words is "two trillion, one hundred fourteen billion, fourteen million, one hundred twelve thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •