Base | Representation |
---|---|
bin | 100110100101011101… |
… | …011001111100010001 |
3 | 10221221101002022211222 |
4 | 212211131121330101 |
5 | 1134322221422422 |
6 | 31011042414425 |
7 | 2664455516603 |
oct | 464535317421 |
9 | 127841068758 |
10 | 41430654737 |
11 | 1663058512a |
12 | 8043061415 |
13 | 3ba35a5024 |
14 | 20105bd173 |
15 | 11273d4842 |
hex | 9a5759f11 |
41430654737 has 2 divisors, whose sum is σ = 41430654738. Its totient is φ = 41430654736.
The previous prime is 41430654701. The next prime is 41430654773. The reversal of 41430654737 is 73745603414.
It is a happy number.
Together with next prime (41430654773) it forms an Ormiston pair, because they use the same digits, order apart.
It is a balanced prime because it is at equal distance from previous prime (41430654701) and next prime (41430654773).
It can be written as a sum of positive squares in only one way, i.e., 35184755776 + 6245898961 = 187576^2 + 79031^2 .
It is a cyclic number.
It is not a de Polignac number, because 41430654737 - 28 = 41430654481 is a prime.
It is not a weakly prime, because it can be changed into another prime (41430614737) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 20715327368 + 20715327369.
It is an arithmetic number, because the mean of its divisors is an integer number (20715327369).
Almost surely, 241430654737 is an apocalyptic number.
It is an amenable number.
41430654737 is a deficient number, since it is larger than the sum of its proper divisors (1).
41430654737 is an equidigital number, since it uses as much as digits as its factorization.
41430654737 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 846720, while the sum is 44.
The spelling of 41430654737 in words is "forty-one billion, four hundred thirty million, six hundred fifty-four thousand, seven hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •