Base | Representation |
---|---|
bin | 10010111100010100101110… |
… | …10011001010100001001111 |
3 | 12110111012011201022122112112 |
4 | 21132022113103022201033 |
5 | 20424434202043020142 |
6 | 224332034134254235 |
7 | 11526324661222532 |
oct | 1136122723124117 |
9 | 173435151278475 |
10 | 41655131220047 |
11 | 122aa929699134 |
12 | 48090631b737b |
13 | 1a320a6343ca7 |
14 | a40194b94a19 |
15 | 4c382b3bc382 |
hex | 25e2974ca84f |
41655131220047 has 2 divisors, whose sum is σ = 41655131220048. Its totient is φ = 41655131220046.
The previous prime is 41655131220029. The next prime is 41655131220071. The reversal of 41655131220047 is 74002213155614.
41655131220047 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 not a de Polignac number, because 41655131220047 - 226 = 41655064111183 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 41655131219986 and 41655131220013.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (41655131220077) 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, 20827565610023 + 20827565610024.
It is an arithmetic number, because the mean of its divisors is an integer number (20827565610024).
Almost surely, 241655131220047 is an apocalyptic number.
41655131220047 is a deficient number, since it is larger than the sum of its proper divisors (1).
41655131220047 is an equidigital number, since it uses as much as digits as its factorization.
41655131220047 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 201600, while the sum is 41.
The spelling of 41655131220047 in words is "forty-one trillion, six hundred fifty-five billion, one hundred thirty-one million, two hundred twenty thousand, forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •