Base | Representation |
---|---|
bin | 10010110101100100011100… |
… | …10111100101111101110001 |
3 | 12102200000010210111021100222 |
4 | 21122302032113211331301 |
5 | 20412133403101331423 |
6 | 224033253220022425 |
7 | 11503500605206553 |
oct | 1132621627457561 |
9 | 172600123437328 |
10 | 41423053152113 |
11 | 12220466675796 |
12 | 4790094831a15 |
13 | 1a1623c280839 |
14 | a32c5a68b4d3 |
15 | 4bc796b8a3c8 |
hex | 25ac8e5e5f71 |
41423053152113 has 8 divisors (see below), whose sum is σ = 42391855879296. Its totient is φ = 40454499330000.
The previous prime is 41423053152101. The next prime is 41423053152127. The reversal of 41423053152113 is 31125135032414.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 41423053152113 - 236 = 41354333675377 is a prime.
It is not an unprimeable number, because it can be changed into a prime (41423053151113) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 61889513 + ... + 62555238.
It is an arithmetic number, because the mean of its divisors is an integer number (5298981984912).
Almost surely, 241423053152113 is an apocalyptic number.
41423053152113 is a gapful number since it is divisible by the number (43) formed by its first and last digit.
It is an amenable number.
41423053152113 is a deficient number, since it is larger than the sum of its proper divisors (968802727183).
41423053152113 is a wasteful number, since it uses less digits than its factorization.
41423053152113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 124452535.
The product of its (nonzero) digits is 43200, while the sum is 35.
Adding to 41423053152113 its reverse (31125135032414), we get a palindrome (72548188184527).
The spelling of 41423053152113 in words is "forty-one trillion, four hundred twenty-three billion, fifty-three million, one hundred fifty-two thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •