Base | Representation |
---|---|
bin | 10010010110010111101001… |
… | …00010110011010001100001 |
3 | 12021212112001100102011011102 |
4 | 21023023310202303101201 |
5 | 20242102400014322431 |
6 | 221453001043524145 |
7 | 11333160012654041 |
oct | 1113136442632141 |
9 | 167775040364142 |
10 | 40351025542241 |
11 | 11947856a73497 |
12 | 4638370989655 |
13 | 19691157771cb |
14 | 9d7000227721 |
15 | 49e951ce9dcb |
hex | 24b2f48b3461 |
40351025542241 has 2 divisors, whose sum is σ = 40351025542242. Its totient is φ = 40351025542240.
The previous prime is 40351025542229. The next prime is 40351025542283. The reversal of 40351025542241 is 14224552015304.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 30517658469841 + 9833367072400 = 5524279^2 + 3135820^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-40351025542241 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 40351025542195 and 40351025542204.
It is not a weakly prime, because it can be changed into another prime (40351025541241) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 20175512771120 + 20175512771121.
It is an arithmetic number, because the mean of its divisors is an integer number (20175512771121).
Almost surely, 240351025542241 is an apocalyptic number.
It is an amenable number.
40351025542241 is a deficient number, since it is larger than the sum of its proper divisors (1).
40351025542241 is an equidigital number, since it uses as much as digits as its factorization.
40351025542241 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 192000, while the sum is 38.
Adding to 40351025542241 its reverse (14224552015304), we get a palindrome (54575577557545).
The spelling of 40351025542241 in words is "forty trillion, three hundred fifty-one billion, twenty-five million, five hundred forty-two thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •