Base | Representation |
---|---|
bin | 10010110000010111101110… |
… | …01000001110000001100111 |
3 | 12102000221001200122202220022 |
4 | 21120023313020032001213 |
5 | 20401222034024300033 |
6 | 223415232000425355 |
7 | 11454545141304410 |
oct | 1130136710160147 |
9 | 172027050582808 |
10 | 41244422103143 |
11 | 121617300457a6 |
12 | 476154161825b |
13 | 1a024421364ac |
14 | a28352600807 |
15 | 4b7cde742098 |
hex | 2582f720e067 |
41244422103143 has 8 divisors (see below), whose sum is σ = 47136555258912. Its totient is φ = 35352307161216.
The previous prime is 41244422103119. The next prime is 41244422103161. The reversal of 41244422103143 is 34130122444214.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 41244422103143 - 232 = 41240127135847 is a prime.
It is a super-2 number, since 2×412444221031432 (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 (41244422103103) 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, 703571 + ... + 9109547.
It is an arithmetic number, because the mean of its divisors is an integer number (5892069407364).
Almost surely, 241244422103143 is an apocalyptic number.
41244422103143 is a deficient number, since it is larger than the sum of its proper divisors (5892133155769).
41244422103143 is an equidigital number, since it uses as much as digits as its factorization.
41244422103143 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9106921.
The product of its (nonzero) digits is 73728, while the sum is 35.
Adding to 41244422103143 its reverse (34130122444214), we get a palindrome (75374544547357).
The spelling of 41244422103143 in words is "forty-one trillion, two hundred forty-four billion, four hundred twenty-two million, one hundred three thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •