Base | Representation |
---|---|
bin | 1100000111000011100011… |
… | …1101011011110110010110 |
3 | 1202010221020221011002121202 |
4 | 3001300320331123312112 |
5 | 3221124321141342200 |
6 | 44152553404312502 |
7 | 2543000614435166 |
oct | 301607075336626 |
9 | 52127227132552 |
10 | 13315354246550 |
11 | 4274012383754 |
12 | 15b0731242732 |
13 | 75782b8450c5 |
14 | 3406764425a6 |
15 | 181569cd21d5 |
hex | c1c38f5bd96 |
13315354246550 has 48 divisors (see below), whose sum is σ = 26223858909360. Its totient is φ = 5012754447360.
The previous prime is 13315354246543. The next prime is 13315354246583. The reversal of 13315354246550 is 5564245351331.
It is a super-2 number, since 2×133153542465502 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 13315354246495 and 13315354246504.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 75576461 + ... + 75752439.
It is an arithmetic number, because the mean of its divisors is an integer number (546330393945).
Almost surely, 213315354246550 is an apocalyptic number.
13315354246550 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
13315354246550 is a deficient number, since it is larger than the sum of its proper divisors (12908504662810).
13315354246550 is a wasteful number, since it uses less digits than its factorization.
13315354246550 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 265025 (or 265020 counting only the distinct ones).
The product of its (nonzero) digits is 3240000, while the sum is 47.
Adding to 13315354246550 its reverse (5564245351331), we get a palindrome (18879599597881).
The spelling of 13315354246550 in words is "thirteen trillion, three hundred fifteen billion, three hundred fifty-four million, two hundred forty-six thousand, five hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •