Base | Representation |
---|---|
bin | 11111001010001111011… |
… | …111100100101011101101 |
3 | 21120201001221212002021211 |
4 | 133022033133210223231 |
5 | 240040341042211023 |
6 | 4315411122354421 |
7 | 310463303211121 |
oct | 37121737445355 |
9 | 7521057762254 |
10 | 2141301132013 |
11 | 75613673573a |
12 | 2a6bb94bba11 |
13 | 126c01869664 |
14 | 758d4c15581 |
15 | 3aa78064a0d |
hex | 1f28f7e4aed |
2141301132013 has 4 divisors (see below), whose sum is σ = 2155672280700. Its totient is φ = 2126929983328.
The previous prime is 2141301131969. The next prime is 2141301132017. The reversal of 2141301132013 is 3102311031412.
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 326455677769 + 1814845454244 = 571363^2 + 1347162^2 .
It is a cyclic number.
It is not a de Polignac number, because 2141301132013 - 229 = 2140764261101 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 (2141301132017) 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, 7185574120 + ... + 7185574417.
It is an arithmetic number, because the mean of its divisors is an integer number (538918070175).
Almost surely, 22141301132013 is an apocalyptic number.
It is an amenable number.
2141301132013 is a deficient number, since it is larger than the sum of its proper divisors (14371148687).
2141301132013 is a wasteful number, since it uses less digits than its factorization.
2141301132013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 14371148686.
The product of its (nonzero) digits is 432, while the sum is 22.
Adding to 2141301132013 its reverse (3102311031412), we get a palindrome (5243612163425).
The spelling of 2141301132013 in words is "two trillion, one hundred forty-one billion, three hundred one million, one hundred thirty-two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •