Base | Representation |
---|---|
bin | 11110110001001101111… |
… | …101111110000010001101 |
3 | 21111010201101211202120112 |
4 | 132301031331332002031 |
5 | 234120324043001031 |
6 | 4255205011525405 |
7 | 305522411312516 |
oct | 36611575760215 |
9 | 7433641752515 |
10 | 2114432000141 |
11 | 7457a881722a |
12 | 2a195abb9865 |
13 | 12450c019766 |
14 | 744a651ba0d |
15 | 3a00423062b |
hex | 1ec4df7e08d |
2114432000141 has 2 divisors, whose sum is σ = 2114432000142. Its totient is φ = 2114432000140.
The previous prime is 2114432000071. The next prime is 2114432000179. The reversal of 2114432000141 is 1410002344112.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1883561360041 + 230870640100 = 1372429^2 + 480490^2 .
It is a cyclic number.
It is not a de Polignac number, because 2114432000141 - 230 = 2113358258317 is a prime.
It is a super-3 number, since 3×21144320001413 (a number of 38 digits) contains 333 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2114432000341) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1057216000070 + 1057216000071.
It is an arithmetic number, because the mean of its divisors is an integer number (1057216000071).
Almost surely, 22114432000141 is an apocalyptic number.
It is an amenable number.
2114432000141 is a deficient number, since it is larger than the sum of its proper divisors (1).
2114432000141 is an equidigital number, since it uses as much as digits as its factorization.
2114432000141 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 768, while the sum is 23.
Adding to 2114432000141 its reverse (1410002344112), we get a palindrome (3524434344253).
The spelling of 2114432000141 in words is "two trillion, one hundred fourteen billion, four hundred thirty-two million, one hundred forty-one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •