Base | Representation |
---|---|
bin | 11000100101100100… |
… | …01100101110011110 |
3 | 1021001221020001222120 |
4 | 30102302030232132 |
5 | 204013203113402 |
6 | 10021454523410 |
7 | 645052404000 |
oct | 142262145636 |
9 | 37057201876 |
10 | 13200051102 |
11 | 56640a2847 |
12 | 2684806566 |
13 | 1324976334 |
14 | 8d3162370 |
15 | 523cbb3bc |
hex | 312c8cb9e |
13200051102 has 32 divisors (see below), whose sum is σ = 30787296000. Its totient is φ = 3771442584.
The previous prime is 13200051101. The next prime is 13200051173. The reversal of 13200051102 is 20115000231.
13200051102 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×132000511022 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13200051101) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 3204952 + ... + 3209067.
It is an arithmetic number, because the mean of its divisors is an integer number (962103000).
Almost surely, 213200051102 is an apocalyptic number.
13200051102 is an abundant number, since it is smaller than the sum of its proper divisors (17587244898).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13200051102 is an equidigital number, since it uses as much as digits as its factorization.
13200051102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6414045 (or 6414031 counting only the distinct ones).
The product of its (nonzero) digits is 60, while the sum is 15.
Adding to 13200051102 its reverse (20115000231), we get a palindrome (33315051333).
The spelling of 13200051102 in words is "thirteen billion, two hundred million, fifty-one thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •