Base | Representation |
---|---|
bin | 11000001101101111… |
… | …00100100110011100 |
3 | 1020120000001011221011 |
4 | 30012313210212130 |
5 | 203111013224040 |
6 | 5545553545004 |
7 | 640104210310 |
oct | 140667444634 |
9 | 36500034834 |
10 | 13000133020 |
11 | 5571266396 |
12 | 2629875164 |
13 | 12c241a404 |
14 | 8b47a1b40 |
15 | 51147b3ea |
hex | 306de499c |
13000133020 has 48 divisors (see below), whose sum is σ = 31214131200. Its totient is φ = 4455215424.
The previous prime is 13000133011. The next prime is 13000133023. The reversal of 13000133020 is 2033100031.
13000133020 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 not an unprimeable number, because it can be changed into a prime (13000133023) 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, 316507 + ... + 355213.
It is an arithmetic number, because the mean of its divisors is an integer number (650294400).
Almost surely, 213000133020 is an apocalyptic number.
13000133020 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
13000133020 is an abundant number, since it is smaller than the sum of its proper divisors (18213998180).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13000133020 is a wasteful number, since it uses less digits than its factorization.
13000133020 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 41122 (or 41120 counting only the distinct ones).
The product of its (nonzero) digits is 54, while the sum is 13.
Adding to 13000133020 its reverse (2033100031), we get a palindrome (15033233051).
The spelling of 13000133020 in words is "thirteen billion, one hundred thirty-three thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •