Base | Representation |
---|---|
bin | 1100000111010101010110… |
… | …1100100100100000000100 |
3 | 1202011101120212002012001012 |
4 | 3001311111230210200010 |
5 | 3221214112110111400 |
6 | 44155103414021352 |
7 | 2543230162130255 |
oct | 301652554444004 |
9 | 52141525065035 |
10 | 13320131332100 |
11 | 427604397783a |
12 | 15b1645047858 |
13 | 758110455848 |
14 | 3409aaa78b2c |
15 | 1817493a4d35 |
hex | c1d55b24804 |
13320131332100 has 18 divisors (see below), whose sum is σ = 28904684990874. Its totient is φ = 5328052532800.
The previous prime is 13320131332097. The next prime is 13320131332141. The reversal of 13320131332100 is 123313102331.
It can be written as a sum of positive squares in 3 ways, for example, as 64459116544 + 13255672215556 = 253888^2 + 3640834^2 .
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 66600656561 + ... + 66600656760.
Almost surely, 213320131332100 is an apocalyptic number.
13320131332100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
13320131332100 is an abundant number, since it is smaller than the sum of its proper divisors (15584553658774).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13320131332100 is a wasteful number, since it uses less digits than its factorization.
13320131332100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 133201313335 (or 133201313328 counting only the distinct ones).
The product of its (nonzero) digits is 972, while the sum is 23.
Adding to 13320131332100 its reverse (123313102331), we get a palindrome (13443444434431).
The spelling of 13320131332100 in words is "thirteen trillion, three hundred twenty billion, one hundred thirty-one million, three hundred thirty-two thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •