Base | Representation |
---|---|
bin | 10010111011111001111000… |
… | …10100110011110011011111 |
3 | 12110102210222101002222022112 |
4 | 21131330330110303303133 |
5 | 20424220143311212001 |
6 | 224321252132304235 |
7 | 11525304601115213 |
oct | 1135747424636337 |
9 | 173383871088275 |
10 | 41640720022751 |
11 | 122a4803977323 |
12 | 4806300a7207b |
13 | 1a3091a7a3005 |
14 | a3d5c8c40943 |
15 | 4c3286112cbb |
hex | 25df3c533cdf |
41640720022751 has 4 divisors (see below), whose sum is σ = 41649426011232. Its totient is φ = 41632014034272.
The previous prime is 41640720022697. The next prime is 41640720022799. The reversal of 41640720022751 is 15722002704614.
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 41640720022751 - 26 = 41640720022687 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 41640720022699 and 41640720022708.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (41640720042751) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4352987066 + ... + 4352996631.
It is an arithmetic number, because the mean of its divisors is an integer number (10412356502808).
Almost surely, 241640720022751 is an apocalyptic number.
41640720022751 is a deficient number, since it is larger than the sum of its proper divisors (8705988481).
41640720022751 is an equidigital number, since it uses as much as digits as its factorization.
41640720022751 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8705988480.
The product of its (nonzero) digits is 188160, while the sum is 41.
The spelling of 41640720022751 in words is "forty-one trillion, six hundred forty billion, seven hundred twenty million, twenty-two thousand, seven hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •