Base | Representation |
---|---|
bin | 10010101001101011001011… |
… | …10101001100010001110001 |
3 | 12101012221012122120111200121 |
4 | 21110311211311030101301 |
5 | 20333434342343332431 |
6 | 223121422141450241 |
7 | 11432121566424535 |
oct | 1124654565142161 |
9 | 171187178514617 |
10 | 41014351152241 |
11 | 120830a7a90065 |
12 | 4724a33270981 |
13 | 19b6837b3c95c |
14 | a1b1688c5bc5 |
15 | 4b1d2632b611 |
hex | 254d65d4c471 |
41014351152241 has 2 divisors, whose sum is σ = 41014351152242. Its totient is φ = 41014351152240.
The previous prime is 41014351152211. The next prime is 41014351152277. The reversal of 41014351152241 is 14225115341014.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 38888893321216 + 2125457831025 = 6236096^2 + 1457895^2 .
It is a cyclic number.
It is not a de Polignac number, because 41014351152241 - 225 = 41014317597809 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 41014351152197 and 41014351152206.
It is not a weakly prime, because it can be changed into another prime (41014351152211) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 20507175576120 + 20507175576121.
It is an arithmetic number, because the mean of its divisors is an integer number (20507175576121).
Almost surely, 241014351152241 is an apocalyptic number.
It is an amenable number.
41014351152241 is a deficient number, since it is larger than the sum of its proper divisors (1).
41014351152241 is an equidigital number, since it uses as much as digits as its factorization.
41014351152241 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 19200, while the sum is 34.
Adding to 41014351152241 its reverse (14225115341014), we get a palindrome (55239466493255).
The spelling of 41014351152241 in words is "forty-one trillion, fourteen billion, three hundred fifty-one million, one hundred fifty-two thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •