Base | Representation |
---|---|
bin | 10010110001111111101010… |
… | …00000111101100111001001 |
3 | 12102020021002102112200010220 |
4 | 21120333311000331213021 |
5 | 20403130323113040241 |
6 | 223501020521300253 |
7 | 11461561661056266 |
oct | 1130776500754711 |
9 | 172207072480126 |
10 | 41300221221321 |
11 | 121833642040a7 |
12 | 4770314634689 |
13 | 1a0779546949a |
14 | a2ad271ac26d |
15 | 4b94a828e166 |
hex | 258ff503d9c9 |
41300221221321 has 8 divisors (see below), whose sum is σ = 55067320084224. Its totient is φ = 27533301586320.
The previous prime is 41300221221283. The next prime is 41300221221341. The reversal of 41300221221321 is 12312212200314.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 41300221221321 - 215 = 41300221188553 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 41300221221291 and 41300221221300.
It is not an unprimeable number, because it can be changed into a prime (41300221221341) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 44268370 + ... + 45191691.
It is an arithmetic number, because the mean of its divisors is an integer number (6883415010528).
Almost surely, 241300221221321 is an apocalyptic number.
It is an amenable number.
41300221221321 is a deficient number, since it is larger than the sum of its proper divisors (13767098862903).
41300221221321 is a wasteful number, since it uses less digits than its factorization.
41300221221321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 89613951.
The product of its (nonzero) digits is 1152, while the sum is 24.
Adding to 41300221221321 its reverse (12312212200314), we get a palindrome (53612433421635).
The spelling of 41300221221321 in words is "forty-one trillion, three hundred billion, two hundred twenty-one million, two hundred twenty-one thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •