Base | Representation |
---|---|
bin | 10010110101000111011010… |
… | …10010001110011000010111 |
3 | 12102121111220110222020010212 |
4 | 21122203231102032120113 |
5 | 20411404442210224002 |
6 | 224022154355040035 |
7 | 11502406413146315 |
oct | 1132435522163027 |
9 | 172544813866125 |
10 | 41407465711127 |
11 | 122148979a365a |
12 | 47890645a001b |
13 | 1a14926b15489 |
14 | a321bc42d0b5 |
15 | 4bc1834d9352 |
hex | 25a8ed48e617 |
41407465711127 has 2 divisors, whose sum is σ = 41407465711128. Its totient is φ = 41407465711126.
The previous prime is 41407465711123. The next prime is 41407465711133. The reversal of 41407465711127 is 72111756470414.
41407465711127 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 41407465711127 - 22 = 41407465711123 is a prime.
It is a super-2 number, since 2×414074657111272 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (41407465711123) 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, 20703732855563 + 20703732855564.
It is an arithmetic number, because the mean of its divisors is an integer number (20703732855564).
Almost surely, 241407465711127 is an apocalyptic number.
41407465711127 is a deficient number, since it is larger than the sum of its proper divisors (1).
41407465711127 is an equidigital number, since it uses as much as digits as its factorization.
41407465711127 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1317120, while the sum is 50.
The spelling of 41407465711127 in words is "forty-one trillion, four hundred seven billion, four hundred sixty-five million, seven hundred eleven thousand, one hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •