Base | Representation |
---|---|
bin | 11000010011110111… |
… | …00100101010011100 |
3 | 1020200120201120200220 |
4 | 30021323210222130 |
5 | 203212141413000 |
6 | 5555031121340 |
7 | 641300014524 |
oct | 141173445234 |
9 | 36616646626 |
10 | 13051513500 |
11 | 559826a2a3 |
12 | 2642b13250 |
13 | 12ccc69c6c |
14 | 8bb538684 |
15 | 515c2a1a0 |
hex | 309ee4a9c |
13051513500 has 48 divisors (see below), whose sum is σ = 38006011680. Its totient is φ = 3480403200.
The previous prime is 13051513493. The next prime is 13051513511. The reversal of 13051513500 is 531515031.
13051513500 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, 4349005 + ... + 4352004.
It is an arithmetic number, because the mean of its divisors is an integer number (791791910).
Almost surely, 213051513500 is an apocalyptic number.
13051513500 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
13051513500 is an abundant number, since it is smaller than the sum of its proper divisors (24954498180).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13051513500 is a wasteful number, since it uses less digits than its factorization.
13051513500 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8701031 (or 8701019 counting only the distinct ones).
The product of its (nonzero) digits is 1125, while the sum is 24.
The spelling of 13051513500 in words is "thirteen billion, fifty-one million, five hundred thirteen thousand, five hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •