Base | Representation |
---|---|
bin | 1100000110110111111000… |
… | …1001101000010110100100 |
3 | 1202010122011111201011102202 |
4 | 3001231332021220112210 |
5 | 3221101411321312400 |
6 | 44151314404554032 |
7 | 2542530136606511 |
oct | 301557611502644 |
9 | 52118144634382 |
10 | 13312220104100 |
11 | 4272754222085 |
12 | 15abbb76b2918 |
13 | 75744c424748 |
14 | 34045a0bc308 |
15 | 181434a924d5 |
hex | c1b7e2685a4 |
13312220104100 has 72 divisors (see below), whose sum is σ = 29470587699168. Its totient is φ = 5218233292800.
The previous prime is 13312220104003. The next prime is 13312220104109. The reversal of 13312220104100 is 140102221331.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is not an unprimeable number, because it can be changed into a prime (13312220104109) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 3854306 + ... + 6440505.
It is an arithmetic number, because the mean of its divisors is an integer number (409313718044).
Almost surely, 213312220104100 is an apocalyptic number.
13312220104100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
13312220104100 is an abundant number, since it is smaller than the sum of its proper divisors (16158367595068).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13312220104100 is a wasteful number, since it uses less digits than its factorization.
13312220104100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10295085 (or 10295078 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 20.
Adding to 13312220104100 its reverse (140102221331), we get a palindrome (13452322325431).
The spelling of 13312220104100 in words is "thirteen trillion, three hundred twelve billion, two hundred twenty million, one hundred four thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.101 sec. • engine limits •