Base | Representation |
---|---|
bin | 1010011000001001111100… |
… | …1100101001100001011001 |
3 | 1111101210110202202000120111 |
4 | 2212002133030221201121 |
5 | 2443420343113000241 |
6 | 40133421320124321 |
7 | 2255232005011522 |
oct | 246023714514131 |
9 | 44353422660514 |
10 | 11410104031321 |
11 | 36a9aa82a0616 |
12 | 13434309066a1 |
13 | 649c78175248 |
14 | 2b637561b849 |
15 | 14bc0a15ec81 |
hex | a609f329859 |
11410104031321 has 8 divisors (see below), whose sum is σ = 11952967996800. Its totient is φ = 10877200872720.
The previous prime is 11410104031289. The next prime is 11410104031331. The reversal of 11410104031321 is 12313040101411.
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 11410104031321 - 25 = 11410104031289 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11410104031292 and 11410104031301.
It is not an unprimeable number, because it can be changed into a prime (11410104031331) 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, 2490199375 + ... + 2490203956.
It is an arithmetic number, because the mean of its divisors is an integer number (1494120999600).
Almost surely, 211410104031321 is an apocalyptic number.
It is an amenable number.
11410104031321 is a deficient number, since it is larger than the sum of its proper divisors (542863965479).
11410104031321 is an equidigital number, since it uses as much as digits as its factorization.
11410104031321 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4980403439.
The product of its (nonzero) digits is 288, while the sum is 22.
Adding to 11410104031321 its reverse (12313040101411), we get a palindrome (23723144132732).
The spelling of 11410104031321 in words is "eleven trillion, four hundred ten billion, one hundred four million, thirty-one thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •