Base | Representation |
---|---|
bin | 100110001100011010… |
… | …000010011010011011 |
3 | 10220212002012012112012 |
4 | 212030122002122123 |
5 | 1132442121412111 |
6 | 30501225540135 |
7 | 2651163102635 |
oct | 461432023233 |
9 | 126762165465 |
10 | 41010341531 |
11 | 164352a5645 |
12 | 7b4634464b |
13 | 3b374a08a3 |
14 | 1db084ba55 |
15 | 110055c48b |
hex | 98c68269b |
41010341531 has 4 divisors (see below), whose sum is σ = 41010817272. Its totient is φ = 41009865792.
The previous prime is 41010341509. The next prime is 41010341557. The reversal of 41010341531 is 13514301014.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It is a cyclic number.
It is not a de Polignac number, because 41010341531 - 26 = 41010341467 is a prime.
It is a super-2 number, since 2×410103415312 (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 = 41010341497 and 41010341506.
It is not an unprimeable number, because it can be changed into a prime (41010341591) 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, 68246 + ... + 294411.
It is an arithmetic number, because the mean of its divisors is an integer number (10252704318).
Almost surely, 241010341531 is an apocalyptic number.
41010341531 is a deficient number, since it is larger than the sum of its proper divisors (475741).
41010341531 is a wasteful number, since it uses less digits than its factorization.
41010341531 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 475740.
The product of its (nonzero) digits is 720, while the sum is 23.
Adding to 41010341531 its reverse (13514301014), we get a palindrome (54524642545).
The spelling of 41010341531 in words is "forty-one billion, ten million, three hundred forty-one thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •