Base | Representation |
---|---|
bin | 1001011110001000001100… |
… | …0110110101100011110001 |
3 | 1100212111021211120000112221 |
4 | 2113202003012311203301 |
5 | 2331102213241124131 |
6 | 34051431434121041 |
7 | 2123220545255302 |
oct | 227420306654361 |
9 | 40774254500487 |
10 | 10413200333041 |
11 | 3355239130a70 |
12 | 1202193880181 |
13 | 5a6c6450b2cc |
14 | 2800044c87a9 |
15 | 130d10661411 |
hex | 978831b58f1 |
10413200333041 has 64 divisors (see below), whose sum is σ = 12378707712000. Its totient is φ = 8665220044800.
The previous prime is 10413200332939. The next prime is 10413200333057. The reversal of 10413200333041 is 14033300231401.
It is not a de Polignac number, because 10413200333041 - 227 = 10413066115313 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10413200332997 and 10413200333015.
It is not an unprimeable number, because it can be changed into a prime (10413200334041) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 88264110 + ... + 88382008.
It is an arithmetic number, because the mean of its divisors is an integer number (193417308000).
Almost surely, 210413200333041 is an apocalyptic number.
10413200333041 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
10413200333041 is a deficient number, since it is larger than the sum of its proper divisors (1965507378959).
10413200333041 is a wasteful number, since it uses less digits than its factorization.
10413200333041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 118150.
The product of its (nonzero) digits is 2592, while the sum is 25.
Adding to 10413200333041 its reverse (14033300231401), we get a palindrome (24446500564442).
The spelling of 10413200333041 in words is "ten trillion, four hundred thirteen billion, two hundred million, three hundred thirty-three thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •