Base | Representation |
---|---|
bin | 11001101000111000… |
… | …10111001011110000 |
3 | 1022112021210212010210 |
4 | 30310130113023300 |
5 | 211142234031422 |
6 | 10153510224120 |
7 | 665050314426 |
oct | 146434271360 |
9 | 38467725123 |
10 | 13764752112 |
11 | 5923930aa1 |
12 | 2801955040 |
13 | 13b4963047 |
14 | 94815b116 |
15 | 55866510c |
hex | 3347172f0 |
13764752112 has 80 divisors (see below), whose sum is σ = 36402991488. Its totient is φ = 4480170240.
The previous prime is 13764752107. The next prime is 13764752129. The reversal of 13764752112 is 21125746731.
13764752112 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a congruent number.
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 15 ways as a sum of consecutive naturals, for example, 523963 + ... + 549605.
Almost surely, 213764752112 is an apocalyptic number.
13764752112 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 13764752112, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (18201495744).
13764752112 is an abundant number, since it is smaller than the sum of its proper divisors (22638239376).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13764752112 is a wasteful number, since it uses less digits than its factorization.
13764752112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25918 (or 25912 counting only the distinct ones).
The product of its digits is 70560, while the sum is 39.
The spelling of 13764752112 in words is "thirteen billion, seven hundred sixty-four million, seven hundred fifty-two thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •