Base | Representation |
---|---|
bin | 10010110101100110011001… |
… | …10110011011001110111101 |
3 | 12102200002211211222220100002 |
4 | 21122303030312123032331 |
5 | 20412143024431001023 |
6 | 224033545224044045 |
7 | 11503535564311202 |
oct | 1132631466331675 |
9 | 172602754886302 |
10 | 41424101422013 |
11 | 12220954368452 |
12 | 4790327903625 |
13 | 1a163784bb79b |
14 | a32d199a1ca9 |
15 | 4bc808c03b28 |
hex | 25acccd9b3bd |
41424101422013 has 4 divisors (see below), whose sum is σ = 41432605656288. Its totient is φ = 41415597187740.
The previous prime is 41424101421971. The next prime is 41424101422019. The reversal of 41424101422013 is 31022410142414.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 41424101422013 - 214 = 41424101405629 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (41424101422019) 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, 4252109831 + ... + 4252119572.
It is an arithmetic number, because the mean of its divisors is an integer number (10358151414072).
Almost surely, 241424101422013 is an apocalyptic number.
It is an amenable number.
41424101422013 is a deficient number, since it is larger than the sum of its proper divisors (8504234275).
41424101422013 is an equidigital number, since it uses as much as digits as its factorization.
41424101422013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8504234274.
The product of its (nonzero) digits is 6144, while the sum is 29.
Adding to 41424101422013 its reverse (31022410142414), we get a palindrome (72446511564427).
The spelling of 41424101422013 in words is "forty-one trillion, four hundred twenty-four billion, one hundred one million, four hundred twenty-two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •