Base | Representation |
---|---|
bin | 1001010100000111001000… |
… | …0011110000011010110001 |
3 | 1100021001002221210220012002 |
4 | 2111001302003300122301 |
5 | 2320242301044333131 |
6 | 33440411545343345 |
7 | 2104616251325504 |
oct | 225016203603261 |
9 | 40231087726162 |
10 | 10241115621041 |
11 | 3299261867918 |
12 | 1194968a97b55 |
13 | 59396b6b9b36 |
14 | 27595ba2513b |
15 | 12b5dccbd6cb |
hex | 950720f06b1 |
10241115621041 has 8 divisors (see below), whose sum is σ = 10699789794624. Its totient is φ = 9783558803920.
The previous prime is 10241115621017. The next prime is 10241115621053. The reversal of 10241115621041 is 14012651114201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10241115621041 - 242 = 5843069109937 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10241115620995 and 10241115621013.
It is not an unprimeable number, because it can be changed into a prime (10241115624041) 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, 279320375 + ... + 279357036.
It is an arithmetic number, because the mean of its divisors is an integer number (1337473724328).
Almost surely, 210241115621041 is an apocalyptic number.
It is an amenable number.
10241115621041 is a deficient number, since it is larger than the sum of its proper divisors (458674173583).
10241115621041 is an equidigital number, since it uses as much as digits as its factorization.
10241115621041 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 558678231.
The product of its (nonzero) digits is 1920, while the sum is 29.
Adding to 10241115621041 its reverse (14012651114201), we get a palindrome (24253766735242).
The spelling of 10241115621041 in words is "ten trillion, two hundred forty-one billion, one hundred fifteen million, six hundred twenty-one thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •