Base | Representation |
---|---|
bin | 10010011000011000011111… |
… | …00011110001011001010101 |
3 | 12022010010121010002012202121 |
4 | 21030030033203301121111 |
5 | 20244221031223231021 |
6 | 221544441023135541 |
7 | 11341156123233043 |
oct | 1114141743613125 |
9 | 168103533065677 |
10 | 40420198258261 |
11 | 11974123189898 |
12 | 46498567445b1 |
13 | 19727ba6a7cc3 |
14 | 9da4c3011393 |
15 | 4a164e994741 |
hex | 24c30f8f1655 |
40420198258261 has 2 divisors, whose sum is σ = 40420198258262. Its totient is φ = 40420198258260.
The previous prime is 40420198258259. The next prime is 40420198258331. The reversal of 40420198258261 is 16285289102404.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 39847732000036 + 572466258225 = 6312506^2 + 756615^2 .
It is a cyclic number.
It is not a de Polignac number, because 40420198258261 - 21 = 40420198258259 is a prime.
Together with 40420198258259, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 40420198258199 and 40420198258208.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (40420198256261) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 20210099129130 + 20210099129131.
It is an arithmetic number, because the mean of its divisors is an integer number (20210099129131).
Almost surely, 240420198258261 is an apocalyptic number.
It is an amenable number.
40420198258261 is a deficient number, since it is larger than the sum of its proper divisors (1).
40420198258261 is an equidigital number, since it uses as much as digits as its factorization.
40420198258261 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2211840, while the sum is 52.
The spelling of 40420198258261 in words is "forty trillion, four hundred twenty billion, one hundred ninety-eight million, two hundred fifty-eight thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •