Base | Representation |
---|---|
bin | 10011001001100100010000… |
… | …00001010101010111010101 |
3 | 12112002200122011021202210221 |
4 | 21210302020001111113111 |
5 | 21004413032200433023 |
6 | 225321044254114341 |
7 | 11604233363141311 |
oct | 1144621001252725 |
9 | 175080564252727 |
10 | 42110141421013 |
11 | 124658a1028736 |
12 | 48812891ab9b1 |
13 | 1a65c7a712ab3 |
14 | a581dac42b41 |
15 | 4d05ac42985d |
hex | 264c880555d5 |
42110141421013 has 2 divisors, whose sum is σ = 42110141421014. Its totient is φ = 42110141421012.
The previous prime is 42110141420899. The next prime is 42110141421037. The reversal of 42110141421013 is 31012414101124.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 25895651355729 + 16214490065284 = 5088777^2 + 4026722^2 .
It is a cyclic number.
It is not a de Polignac number, because 42110141421013 - 213 = 42110141412821 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (42110141421913) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 21055070710506 + 21055070710507.
It is an arithmetic number, because the mean of its divisors is an integer number (21055070710507).
Almost surely, 242110141421013 is an apocalyptic number.
It is an amenable number.
42110141421013 is a deficient number, since it is larger than the sum of its proper divisors (1).
42110141421013 is an equidigital number, since it uses as much as digits as its factorization.
42110141421013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 768, while the sum is 25.
Adding to 42110141421013 its reverse (31012414101124), we get a palindrome (73122555522137).
The spelling of 42110141421013 in words is "forty-two trillion, one hundred ten billion, one hundred forty-one million, four hundred twenty-one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •