Base | Representation |
---|---|
bin | 10011000111001111001101… |
… | …11110100001010000111101 |
3 | 12111211001010000221120110212 |
4 | 21203213212332201100331 |
5 | 21002110201303441341 |
6 | 225220213014442205 |
7 | 11565401543364146 |
oct | 1143474676412075 |
9 | 174731100846425 |
10 | 42030130140221 |
11 | 12434972817193 |
12 | 4869879663365 |
13 | 1a5b56915b472 |
14 | a543aa7acacd |
15 | 4cd477e7d5eb |
hex | 2639e6fa143d |
42030130140221 has 2 divisors, whose sum is σ = 42030130140222. Its totient is φ = 42030130140220.
The previous prime is 42030130140197. The next prime is 42030130140223. The reversal of 42030130140221 is 12204103103024.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 38428716828100 + 3601413312121 = 6199090^2 + 1897739^2 .
It is a cyclic number.
It is not a de Polignac number, because 42030130140221 - 26 = 42030130140157 is a prime.
Together with 42030130140223, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (42030130140223) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 21015065070110 + 21015065070111.
It is an arithmetic number, because the mean of its divisors is an integer number (21015065070111).
Almost surely, 242030130140221 is an apocalyptic number.
It is an amenable number.
42030130140221 is a deficient number, since it is larger than the sum of its proper divisors (1).
42030130140221 is an equidigital number, since it uses as much as digits as its factorization.
42030130140221 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1152, while the sum is 23.
Adding to 42030130140221 its reverse (12204103103024), we get a palindrome (54234233243245).
The spelling of 42030130140221 in words is "forty-two trillion, thirty billion, one hundred thirty million, one hundred forty thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •