Base | Representation |
---|---|
bin | 10010101111000111100111… |
… | …00111000101000011010111 |
3 | 12101212211001100012211201122 |
4 | 21113203303213011003113 |
5 | 20400020443313123111 |
6 | 223343400143114155 |
7 | 11451463301406446 |
oct | 1127436347050327 |
9 | 171784040184648 |
10 | 41201413411031 |
11 | 1214546a82a855 |
12 | 4755139ba295b |
13 | 19cb379948253 |
14 | a26232606d5d |
15 | 4b6b23a4acdb |
hex | 2578f39c50d7 |
41201413411031 has 4 divisors (see below), whose sum is σ = 41229233408064. Its totient is φ = 41173593414000.
The previous prime is 41201413411019. The next prime is 41201413411049. The reversal of 41201413411031 is 13011431410214.
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 41201413411031 - 238 = 40926535504087 is a prime.
It is a super-2 number, since 2×412014134110312 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (41201413491031) 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, 13909996295 + ... + 13909999256.
It is an arithmetic number, because the mean of its divisors is an integer number (10307308352016).
Almost surely, 241201413411031 is an apocalyptic number.
41201413411031 is a deficient number, since it is larger than the sum of its proper divisors (27819997033).
41201413411031 is a wasteful number, since it uses less digits than its factorization.
41201413411031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27819997032.
The product of its (nonzero) digits is 1152, while the sum is 26.
Adding to 41201413411031 its reverse (13011431410214), we get a palindrome (54212844821245).
The spelling of 41201413411031 in words is "forty-one trillion, two hundred one billion, four hundred thirteen million, four hundred eleven thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •