Base | Representation |
---|---|
bin | 11000101011101101… |
… | …00000111111011100 |
3 | 1021012112001200021010 |
4 | 30111312200333130 |
5 | 204114341424312 |
6 | 10030533535220 |
7 | 646246004400 |
oct | 142566407734 |
9 | 37175050233 |
10 | 13251514332 |
11 | 5690152941 |
12 | 2699aa4510 |
13 | 1332524754 |
14 | 8d9d1b100 |
15 | 52858493c |
hex | 315da0fdc |
13251514332 has 144 divisors (see below), whose sum is σ = 37495989888. Its totient is φ = 3628437120.
The previous prime is 13251514319. The next prime is 13251514343. The reversal of 13251514332 is 23341515231.
It is a self number, because there is not a number n which added to its sum of digits gives 13251514332.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 1453107 + ... + 1462197.
Almost surely, 213251514332 is an apocalyptic number.
13251514332 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 13251514332, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (18747994944).
13251514332 is an abundant number, since it is smaller than the sum of its proper divisors (24244475556).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13251514332 is a wasteful number, since it uses less digits than its factorization.
13251514332 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9216 (or 9207 counting only the distinct ones).
The product of its digits is 10800, while the sum is 30.
The spelling of 13251514332 in words is "thirteen billion, two hundred fifty-one million, five hundred fourteen thousand, three hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •