Base | Representation |
---|---|
bin | 11000010000001110… |
… | …10010101001011000 |
3 | 1020121110100220120102 |
4 | 30020013102221120 |
5 | 203131340443000 |
6 | 5552021514532 |
7 | 640446636335 |
oct | 141007225130 |
9 | 36543326512 |
10 | 13021031000 |
11 | 558203a34a |
12 | 2634872a48 |
13 | 12c6856493 |
14 | 8b748198c |
15 | 5132083d5 |
hex | 3081d2a58 |
13021031000 has 128 divisors (see below), whose sum is σ = 32562129600. Its totient is φ = 4856371200.
The previous prime is 13021030993. The next prime is 13021031021. The reversal of 13021031000 is 13012031.
It is a super-2 number, since 2×130210310002 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1849487 + ... + 1856513.
Almost surely, 213021031000 is an apocalyptic number.
13021031000 is a gapful number since it is divisible by the number (10) 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 13021031000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (16281064800).
13021031000 is an abundant number, since it is smaller than the sum of its proper divisors (19541098600).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13021031000 is a wasteful number, since it uses less digits than its factorization.
13021031000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7174 (or 7160 counting only the distinct ones).
The product of its (nonzero) digits is 18, while the sum is 11.
Adding to 13021031000 its reverse (13012031), we get a palindrome (13034043031).
The spelling of 13021031000 in words is "thirteen billion, twenty-one million, thirty-one thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •