Base | Representation |
---|---|
bin | 10010011011100101010000… |
… | …01000100011101000011001 |
3 | 12022111122100121020010021111 |
4 | 21031302220020203220121 |
5 | 20303021202322023231 |
6 | 222111141413340321 |
7 | 11352130313421313 |
oct | 1115625010435031 |
9 | 168448317203244 |
10 | 40530132220441 |
11 | 11a06807024796 |
12 | 46670173376a1 |
13 | 197cc8a2c2976 |
14 | a019515247b3 |
15 | 4a4435d954b1 |
hex | 24dca8223a19 |
40530132220441 has 2 divisors, whose sum is σ = 40530132220442. Its totient is φ = 40530132220440.
The previous prime is 40530132220429. The next prime is 40530132220559. The reversal of 40530132220441 is 14402223103504.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 37186774825216 + 3343357395225 = 6098096^2 + 1828485^2 .
It is a cyclic number.
It is not a de Polignac number, because 40530132220441 - 211 = 40530132218393 is a prime.
It is not a weakly prime, because it can be changed into another prime (40530132220141) 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, 20265066110220 + 20265066110221.
It is an arithmetic number, because the mean of its divisors is an integer number (20265066110221).
Almost surely, 240530132220441 is an apocalyptic number.
It is an amenable number.
40530132220441 is a deficient number, since it is larger than the sum of its proper divisors (1).
40530132220441 is an equidigital number, since it uses as much as digits as its factorization.
40530132220441 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 23040, while the sum is 31.
Adding to 40530132220441 its reverse (14402223103504), we get a palindrome (54932355323945).
The spelling of 40530132220441 in words is "forty trillion, five hundred thirty billion, one hundred thirty-two million, two hundred twenty thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •