Base | Representation |
---|---|
bin | 1010010100001000100100… |
… | …0100001000000000100101 |
3 | 1111011012010201012020001000 |
4 | 2211002021010020000211 |
5 | 2441302343341041123 |
6 | 40041553424223513 |
7 | 2250234610555041 |
oct | 245021104100045 |
9 | 44135121166030 |
10 | 11341013221413 |
11 | 3682773338517 |
12 | 1331b6a46ab99 |
13 | 6435b71c12c5 |
14 | 2b2c9d675021 |
15 | 14a014793b43 |
hex | a5089108025 |
11341013221413 has 256 divisors, whose sum is σ = 18800706355200. Its totient is φ = 6726660526080.
The previous prime is 11341013221381. The next prime is 11341013221451. The reversal of 11341013221413 is 31412231014311.
11341013221413 is a `hidden beast` number, since 1 + 1 + 3 + 4 + 10 + 13 + 221 + 413 = 666.
It is not a de Polignac number, because 11341013221413 - 25 = 11341013221381 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11341013321413) by changing a digit.
It is a polite number, since it can be written in 255 ways as a sum of consecutive naturals, for example, 34262879658 + ... + 34262879988.
It is an arithmetic number, because the mean of its divisors is an integer number (73440259200).
Almost surely, 211341013221413 is an apocalyptic number.
It is an amenable number.
11341013221413 is a deficient number, since it is larger than the sum of its proper divisors (7459693133787).
11341013221413 is a wasteful number, since it uses less digits than its factorization.
11341013221413 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 809 (or 803 counting only the distinct ones).
The product of its (nonzero) digits is 1728, while the sum is 27.
Adding to 11341013221413 its reverse (31412231014311), we get a palindrome (42753244235724).
The spelling of 11341013221413 in words is "eleven trillion, three hundred forty-one billion, thirteen million, two hundred twenty-one thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •