Base | Representation |
---|---|
bin | 10010101001010100110000… |
… | …01001010111110010000001 |
3 | 12101011210010111202222100121 |
4 | 21110222120021113302001 |
5 | 20333240212430314103 |
6 | 223112111254420241 |
7 | 11431214321634133 |
oct | 1124523011276201 |
9 | 171153114688317 |
10 | 41002310401153 |
11 | 12078a89325602 |
12 | 4722632961681 |
13 | 19b566940a77a |
14 | a1a7456db053 |
15 | 4b186e20b6bd |
hex | 254a98257c81 |
41002310401153 has 2 divisors, whose sum is σ = 41002310401154. Its totient is φ = 41002310401152.
The previous prime is 41002310401139. The next prime is 41002310401177. The reversal of 41002310401153 is 35110401320014.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 31225106971249 + 9777203429904 = 5587943^2 + 3126852^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-41002310401153 is a prime.
It is not a weakly prime, because it can be changed into another prime (41002310401133) 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, 20501155200576 + 20501155200577.
It is an arithmetic number, because the mean of its divisors is an integer number (20501155200577).
Almost surely, 241002310401153 is an apocalyptic number.
It is an amenable number.
41002310401153 is a deficient number, since it is larger than the sum of its proper divisors (1).
41002310401153 is an equidigital number, since it uses as much as digits as its factorization.
41002310401153 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1440, while the sum is 25.
Adding to 41002310401153 its reverse (35110401320014), we get a palindrome (76112711721167).
The spelling of 41002310401153 in words is "forty-one trillion, two billion, three hundred ten million, four hundred one thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •