Base | Representation |
---|---|
bin | 1100010111111011110011… |
… | …1001000011010101000000 |
3 | 1210011122201212121222120011 |
4 | 3011332330321003111000 |
5 | 3240402204101431010 |
6 | 44534111425554304 |
7 | 2602644526060441 |
oct | 305767471032500 |
9 | 53148655558504 |
10 | 13605330498880 |
11 | 4375a96415a6a |
12 | 16389797a5994 |
13 | 778c91a90373 |
14 | 3507041dd2c8 |
15 | 188d8c491a8a |
hex | c5fbce43540 |
13605330498880 has 28 divisors (see below), whose sum is σ = 32397693251220. Its totient is φ = 5442132199424.
The previous prime is 13605330498827. The next prime is 13605330498899. The reversal of 13605330498880 is 8889403350631.
13605330498880 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 2 ways, for example, as 1388739688704 + 12216590810176 = 1178448^2 + 3495224^2 .
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 21258328585 + ... + 21258329224.
Almost surely, 213605330498880 is an apocalyptic number.
13605330498880 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
13605330498880 is an abundant number, since it is smaller than the sum of its proper divisors (18792362752340).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13605330498880 is an equidigital number, since it uses as much as digits as its factorization.
13605330498880 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 42516657826 (or 42516657816 counting only the distinct ones).
The product of its (nonzero) digits is 14929920, while the sum is 58.
The spelling of 13605330498880 in words is "thirteen trillion, six hundred five billion, three hundred thirty million, four hundred ninety-eight thousand, eight hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.101 sec. • engine limits •