Base | Representation |
---|---|
bin | 10011000110011011001101… |
… | …11001000100101101110101 |
3 | 12111201101001022221220021102 |
4 | 21203031212321010231311 |
5 | 21001131012111101031 |
6 | 225155314411455445 |
7 | 11563362645254312 |
oct | 1143154671045565 |
9 | 174641038856242 |
10 | 42002211425141 |
11 | 12424046399340 |
12 | 4864387757585 |
13 | 1a58a3a030906 |
14 | a52cbc93bd09 |
15 | 4cc891e217cb |
hex | 263366e44b75 |
42002211425141 has 16 divisors (see below), whose sum is σ = 46939016654208. Its totient is φ = 37251843532800.
The previous prime is 42002211425131. The next prime is 42002211425173. The reversal of 42002211425141 is 14152411220024.
It is a cyclic number.
It is not a de Polignac number, because 42002211425141 - 214 = 42002211408757 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 (42002211425131) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 25068245 + ... + 26691221.
It is an arithmetic number, because the mean of its divisors is an integer number (2933688540888).
Almost surely, 242002211425141 is an apocalyptic number.
42002211425141 is a gapful number since it is divisible by the number (41) formed by its first and last digit.
It is an amenable number.
42002211425141 is a deficient number, since it is larger than the sum of its proper divisors (4936805229067).
42002211425141 is a wasteful number, since it uses less digits than its factorization.
42002211425141 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1680412.
The product of its (nonzero) digits is 5120, while the sum is 29.
Adding to 42002211425141 its reverse (14152411220024), we get a palindrome (56154622645165).
The spelling of 42002211425141 in words is "forty-two trillion, two billion, two hundred eleven million, four hundred twenty-five thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •