Base | Representation |
---|---|
bin | 100110010010100011… |
… | …001011101100010011 |
3 | 10221010021010020002110 |
4 | 212102203023230103 |
5 | 1133200012332011 |
6 | 30515350520403 |
7 | 2653554103104 |
oct | 462243135423 |
9 | 127107106073 |
10 | 41113402131 |
11 | 1648849759a |
12 | 7b74966103 |
13 | 3b529464a9 |
14 | 1dc03d83ab |
15 | 1109618ba6 |
hex | 9928cbb13 |
41113402131 has 8 divisors (see below), whose sum is σ = 54822810064. Its totient is φ = 27406464480.
The previous prime is 41113402081. The next prime is 41113402153. The reversal of 41113402131 is 13120431114.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 41113402131 - 26 = 41113402067 is a prime.
It is a super-2 number, since 2×411134021312 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 41113402098 and 41113402107.
It is not an unprimeable number, because it can be changed into a prime (41113402931) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 578380 + ... + 645561.
It is an arithmetic number, because the mean of its divisors is an integer number (6852851258).
Almost surely, 241113402131 is an apocalyptic number.
41113402131 is a deficient number, since it is larger than the sum of its proper divisors (13709407933).
41113402131 is a wasteful number, since it uses less digits than its factorization.
41113402131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1235141.
The product of its (nonzero) digits is 288, while the sum is 21.
Adding to 41113402131 its reverse (13120431114), we get a palindrome (54233833245).
The spelling of 41113402131 in words is "forty-one billion, one hundred thirteen million, four hundred two thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •