Base | Representation |
---|---|
bin | 10010101111101010110101… |
… | …01011001010111101001111 |
3 | 12101221121212010211022201220 |
4 | 21113311122223022331033 |
5 | 20400323210013444343 |
6 | 223400204340334423 |
7 | 11453033005253352 |
oct | 1127653253127517 |
9 | 171847763738656 |
10 | 41220322406223 |
11 | 12152493428804 |
12 | 47589366a4413 |
13 | 1a000a12a15bc |
14 | a27107a52299 |
15 | 4b737db0b183 |
hex | 257d5aacaf4f |
41220322406223 has 4 divisors (see below), whose sum is σ = 54960429874968. Its totient is φ = 27480214937480.
The previous prime is 41220322406189. The next prime is 41220322406251. The reversal of 41220322406223 is 32260422302214.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 41220322406223 - 28 = 41220322405967 is a prime.
It is a super-2 number, since 2×412203224062232 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (41220322406273) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 6870053734368 + ... + 6870053734373.
It is an arithmetic number, because the mean of its divisors is an integer number (13740107468742).
Almost surely, 241220322406223 is an apocalyptic number.
41220322406223 is a deficient number, since it is larger than the sum of its proper divisors (13740107468745).
41220322406223 is a wasteful number, since it uses less digits than its factorization.
41220322406223 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 13740107468744.
The product of its (nonzero) digits is 55296, while the sum is 33.
Adding to 41220322406223 its reverse (32260422302214), we get a palindrome (73480744708437).
The spelling of 41220322406223 in words is "forty-one trillion, two hundred twenty billion, three hundred twenty-two million, four hundred six thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •