Base | Representation |
---|---|
bin | 10011010010010111001000… |
… | …11110101010001110000001 |
3 | 12120011120122220211121021211 |
4 | 21221023210132222032001 |
5 | 21024340433110320301 |
6 | 230111543221250121 |
7 | 11635122221341342 |
oct | 1151134436521601 |
9 | 176146586747254 |
10 | 42412340323201 |
11 | 12571a77474772 |
12 | 490b966b63941 |
13 | 1a8860ac7a454 |
14 | a68aa80180c9 |
15 | 4d8397b8a051 |
hex | 2692e47aa381 |
42412340323201 has 2 divisors, whose sum is σ = 42412340323202. Its totient is φ = 42412340323200.
The previous prime is 42412340323103. The next prime is 42412340323217. The reversal of 42412340323201 is 10232304321424.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 42079871610000 + 332468713201 = 6486900^2 + 576601^2 .
It is a cyclic number.
It is not a de Polignac number, because 42412340323201 - 217 = 42412340192129 is a prime.
It is a super-2 number, since 2×424123403232012 (a number of 28 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (42412340323271) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 21206170161600 + 21206170161601.
It is an arithmetic number, because the mean of its divisors is an integer number (21206170161601).
Almost surely, 242412340323201 is an apocalyptic number.
It is an amenable number.
42412340323201 is a deficient number, since it is larger than the sum of its proper divisors (1).
42412340323201 is an equidigital number, since it uses as much as digits as its factorization.
42412340323201 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 27648, while the sum is 31.
Adding to 42412340323201 its reverse (10232304321424), we get a palindrome (52644644644625).
The spelling of 42412340323201 in words is "forty-two trillion, four hundred twelve billion, three hundred forty million, three hundred twenty-three thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •