Base | Representation |
---|---|
bin | 10010101010001110010111… |
… | …01100011110011000110101 |
3 | 12101021201222001022000112201 |
4 | 21111013023230132120311 |
5 | 20334242033420343331 |
6 | 223134224335344501 |
7 | 11433360640200523 |
oct | 1125071354363065 |
9 | 171251861260481 |
10 | 41033240012341 |
11 | 12090110286245 |
12 | 4728625082131 |
13 | 19b8558266255 |
14 | a1c03b3ad313 |
15 | 4b257e760a61 |
hex | 2551cbb1e635 |
41033240012341 has 4 divisors (see below), whose sum is σ = 41033350251072. Its totient is φ = 41033129773612.
The previous prime is 41033240012329. The next prime is 41033240012351. The reversal of 41033240012341 is 14321004233014.
It is a happy number.
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 41033240012341 - 25 = 41033240012309 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 (41033240012351) 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, 54559135 + ... + 55306108.
It is an arithmetic number, because the mean of its divisors is an integer number (10258337562768).
Almost surely, 241033240012341 is an apocalyptic number.
It is an amenable number.
41033240012341 is a deficient number, since it is larger than the sum of its proper divisors (110238731).
41033240012341 is a wasteful number, since it uses less digits than its factorization.
41033240012341 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 110238730.
The product of its (nonzero) digits is 6912, while the sum is 28.
Adding to 41033240012341 its reverse (14321004233014), we get a palindrome (55354244245355).
The spelling of 41033240012341 in words is "forty-one trillion, thirty-three billion, two hundred forty million, twelve thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •