Base | Representation |
---|---|
bin | 10010101010001010101010… |
… | …10100011111110100001011 |
3 | 12101021112211122021220200122 |
4 | 21111011111110133310023 |
5 | 20334224002011441433 |
6 | 223133255312453455 |
7 | 11433260503406522 |
oct | 1125052524376413 |
9 | 171245748256618 |
10 | 41031254015243 |
11 | 1208a291233228 |
12 | 472816bb4a28b |
13 | 19b82cc98273b |
14 | a1bccd71b4b9 |
15 | 4b24b5217198 |
hex | 25515551fd0b |
41031254015243 has 2 divisors, whose sum is σ = 41031254015244. Its totient is φ = 41031254015242.
The previous prime is 41031254015237. The next prime is 41031254015291. The reversal of 41031254015243 is 34251045213014.
41031254015243 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-41031254015243 is a prime.
It is a Sophie Germain prime.
It is not a weakly prime, because it can be changed into another prime (41031254035243) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 20515627007621 + 20515627007622.
It is an arithmetic number, because the mean of its divisors is an integer number (20515627007622).
Almost surely, 241031254015243 is an apocalyptic number.
41031254015243 is a deficient number, since it is larger than the sum of its proper divisors (1).
41031254015243 is an equidigital number, since it uses as much as digits as its factorization.
41031254015243 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 57600, while the sum is 35.
Adding to 41031254015243 its reverse (34251045213014), we get a palindrome (75282299228257).
The spelling of 41031254015243 in words is "forty-one trillion, thirty-one billion, two hundred fifty-four million, fifteen thousand, two hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •