Base | Representation |
---|---|
bin | 100111101011011101… |
… | …011100001101010101 |
3 | 11001222012221202112202 |
4 | 213223131130031111 |
5 | 1144223344203031 |
6 | 31323354254245 |
7 | 3035536053365 |
oct | 475335341525 |
9 | 131865852482 |
10 | 42605069141 |
11 | 170834a6048 |
12 | 8310427385 |
13 | 402c9ab8ab |
14 | 20c256c9a5 |
15 | 11955692cb |
hex | 9eb75c355 |
42605069141 has 2 divisors, whose sum is σ = 42605069142. Its totient is φ = 42605069140.
The previous prime is 42605069131. The next prime is 42605069147. The reversal of 42605069141 is 14196050624.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 26966566225 + 15638502916 = 164215^2 + 125054^2 .
It is a cyclic number.
It is not a de Polignac number, because 42605069141 - 214 = 42605052757 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 42605069095 and 42605069104.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (42605069147) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 21302534570 + 21302534571.
It is an arithmetic number, because the mean of its divisors is an integer number (21302534571).
Almost surely, 242605069141 is an apocalyptic number.
It is an amenable number.
42605069141 is a deficient number, since it is larger than the sum of its proper divisors (1).
42605069141 is an equidigital number, since it uses as much as digits as its factorization.
42605069141 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 51840, while the sum is 38.
The spelling of 42605069141 in words is "forty-two billion, six hundred five million, sixty-nine thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •