Base | Representation |
---|---|
bin | 100110100011101000… |
… | …111100001010011101 |
3 | 10221212020122012122012 |
4 | 212203220330022131 |
5 | 1134241412432221 |
6 | 31004032201005 |
7 | 2663635151102 |
oct | 464350741235 |
9 | 127766565565 |
10 | 41400124061 |
11 | 16615321a6a |
12 | 8034999165 |
13 | 3b9a17563a |
14 | 200a512aa9 |
15 | 11248a365b |
hex | 9a3a3c29d |
41400124061 has 2 divisors, whose sum is σ = 41400124062. Its totient is φ = 41400124060.
The previous prime is 41400124013. The next prime is 41400124067. The reversal of 41400124061 is 16042100414.
It is a happy number.
41400124061 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 can be written as a sum of positive squares in only one way, i.e., 36126604900 + 5273519161 = 190070^2 + 72619^2 .
It is a cyclic number.
It is not a de Polignac number, because 41400124061 - 26 = 41400123997 is a prime.
It is a super-2 number, since 2×414001240612 (a number of 22 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (41400124067) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 20700062030 + 20700062031.
It is an arithmetic number, because the mean of its divisors is an integer number (20700062031).
Almost surely, 241400124061 is an apocalyptic number.
It is an amenable number.
41400124061 is a deficient number, since it is larger than the sum of its proper divisors (1).
41400124061 is an equidigital number, since it uses as much as digits as its factorization.
41400124061 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 768, while the sum is 23.
Adding to 41400124061 its reverse (16042100414), we get a palindrome (57442224475).
The spelling of 41400124061 in words is "forty-one billion, four hundred million, one hundred twenty-four thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •