Base | Representation |
---|---|
bin | 10010101010010000011000… |
… | …10100010111001000100011 |
3 | 12101021211202121101222102101 |
4 | 21111020030110113020203 |
5 | 20334301243444211321 |
6 | 223134524105431231 |
7 | 11433426543550333 |
oct | 1125101424271043 |
9 | 171254677358371 |
10 | 41034324210211 |
11 | 12090617288142 |
12 | 472888819b517 |
13 | 19b869ba73457 |
14 | a1c1013970c3 |
15 | 4b25e4a24791 |
hex | 25520c517223 |
41034324210211 has 4 divisors (see below), whose sum is σ = 41035843070712. Its totient is φ = 41032805349712.
The previous prime is 41034324210119. The next prime is 41034324210247. The reversal of 41034324210211 is 11201242343014.
It is a happy number.
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 41034324210211 - 217 = 41034324079139 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 41034324210211.
It is not an unprimeable number, because it can be changed into a prime (41034324210511) 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, 759389725 + ... + 759443758.
It is an arithmetic number, because the mean of its divisors is an integer number (10258960767678).
Almost surely, 241034324210211 is an apocalyptic number.
41034324210211 is a deficient number, since it is larger than the sum of its proper divisors (1518860501).
41034324210211 is a wasteful number, since it uses less digits than its factorization.
41034324210211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1518860500.
The product of its (nonzero) digits is 4608, while the sum is 28.
Adding to 41034324210211 its reverse (11201242343014), we get a palindrome (52235566553225).
The spelling of 41034324210211 in words is "forty-one trillion, thirty-four billion, three hundred twenty-four million, two hundred ten thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.116 sec. • engine limits •