Base | Representation |
---|---|
bin | 1100000000010101110101… |
… | …1000110111111001011110 |
3 | 1201201220111210020100221012 |
4 | 3000011131120313321132 |
5 | 3212232100313131420 |
6 | 44023555154335222 |
7 | 2531445223540550 |
oct | 300053530677136 |
9 | 51656453210835 |
10 | 13200001302110 |
11 | 422a0a8680217 |
12 | 15922b988a512 |
13 | 7499a734216c |
14 | 338c523654d0 |
15 | 17d567cb6dc5 |
hex | c015d637e5e |
13200001302110 has 96 divisors (see below), whose sum is σ = 28849828691520. Its totient is φ = 4258865737728.
The previous prime is 13200001302107. The next prime is 13200001302151. The reversal of 13200001302110 is 1120310000231.
It is a Harshad number since it is a multiple of its sum of digits (14).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 147816434 + ... + 147905706.
It is an arithmetic number, because the mean of its divisors is an integer number (300519048870).
Almost surely, 213200001302110 is an apocalyptic number.
13200001302110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
13200001302110 is an abundant number, since it is smaller than the sum of its proper divisors (15649827389410).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13200001302110 is a wasteful number, since it uses less digits than its factorization.
13200001302110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 96630 (or 96613 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 14.
Adding to 13200001302110 its reverse (1120310000231), we get a palindrome (14320311302341).
The spelling of 13200001302110 in words is "thirteen trillion, two hundred billion, one million, three hundred two thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •