Base | Representation |
---|---|
bin | 11110100101000101010… |
… | …010001011111100000101 |
3 | 21102220002021110211220211 |
4 | 132211011102023330011 |
5 | 233412132224400031 |
6 | 4245212004555421 |
7 | 304551454132015 |
oct | 36450522137405 |
9 | 7386067424824 |
10 | 2101401403141 |
11 | 7402213438a7 |
12 | 29b3230b2b71 |
13 | 1232134c4131 |
14 | 739cbaa9c45 |
15 | 399e0287bb1 |
hex | 1e94548bf05 |
2101401403141 has 4 divisors (see below), whose sum is σ = 2114786125612. Its totient is φ = 2088016680672.
The previous prime is 2101401403109. The next prime is 2101401403181. The reversal of 2101401403141 is 1413041041012.
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 608471762116 + 1492929641025 = 780046^2 + 1221855^2 .
It is a cyclic number.
It is not a de Polignac number, because 2101401403141 - 25 = 2101401403109 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 (2101401403181) 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, 6692361000 + ... + 6692361313.
It is an arithmetic number, because the mean of its divisors is an integer number (528696531403).
Almost surely, 22101401403141 is an apocalyptic number.
It is an amenable number.
2101401403141 is a deficient number, since it is larger than the sum of its proper divisors (13384722471).
2101401403141 is a wasteful number, since it uses less digits than its factorization.
2101401403141 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 13384722470.
The product of its (nonzero) digits is 384, while the sum is 22.
Adding to 2101401403141 its reverse (1413041041012), we get a palindrome (3514442444153).
The spelling of 2101401403141 in words is "two trillion, one hundred one billion, four hundred one million, four hundred three thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •