Base | Representation |
---|---|
bin | 10010101011000110011000… |
… | …10101000011111101000111 |
3 | 12101101121121001111011221221 |
4 | 21111203030111003331013 |
5 | 20340240132222014142 |
6 | 223200120544021211 |
7 | 11435504144026621 |
oct | 1125431425037507 |
9 | 171347531434857 |
10 | 41063315423047 |
11 | 120a1944046475 |
12 | 4732419301807 |
13 | 19bb33c142868 |
14 | a1d691847c11 |
15 | 4b323ecd3767 |
hex | 2558cc543f47 |
41063315423047 has 2 divisors, whose sum is σ = 41063315423048. Its totient is φ = 41063315423046.
The previous prime is 41063315423023. The next prime is 41063315423063. The reversal of 41063315423047 is 74032451336014.
41063315423047 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-41063315423047 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 41063315422994 and 41063315423012.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (41063315423747) 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, 20531657711523 + 20531657711524.
It is an arithmetic number, because the mean of its divisors is an integer number (20531657711524).
Almost surely, 241063315423047 is an apocalyptic number.
41063315423047 is a deficient number, since it is larger than the sum of its proper divisors (1).
41063315423047 is an equidigital number, since it uses as much as digits as its factorization.
41063315423047 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 725760, while the sum is 43.
The spelling of 41063315423047 in words is "forty-one trillion, sixty-three billion, three hundred fifteen million, four hundred twenty-three thousand, forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •