Base | Representation |
---|---|
bin | 10010101001101010101110… |
… | …11101110011011011100011 |
3 | 12101012220120212001211020011 |
4 | 21110311113131303123203 |
5 | 20333433344143441011 |
6 | 223121342212025351 |
7 | 11432112612025402 |
oct | 1124652735633343 |
9 | 171186525054204 |
10 | 41014110140131 |
11 | 12082a93a360a7 |
12 | 4724986602257 |
13 | 19b67c9c2623b |
14 | a1b1448a9639 |
15 | 4b1d100c0621 |
hex | 254d577736e3 |
41014110140131 has 4 divisors (see below), whose sum is σ = 41259703614192. Its totient is φ = 40768516666072.
The previous prime is 41014110140123. The next prime is 41014110140177. The reversal of 41014110140131 is 13104101141014.
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 41014110140131 - 23 = 41014110140123 is a prime.
It is a super-2 number, since 2×410141101401312 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (41014110140191) 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, 122796736780 + ... + 122796737113.
It is an arithmetic number, because the mean of its divisors is an integer number (10314925903548).
Almost surely, 241014110140131 is an apocalyptic number.
41014110140131 is a deficient number, since it is larger than the sum of its proper divisors (245593474061).
41014110140131 is a wasteful number, since it uses less digits than its factorization.
41014110140131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 245593474060.
The product of its (nonzero) digits is 192, while the sum is 22.
Adding to 41014110140131 its reverse (13104101141014), we get a palindrome (54118211281145).
The spelling of 41014110140131 in words is "forty-one trillion, fourteen billion, one hundred ten million, one hundred forty thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •