Base | Representation |
---|---|
bin | 11000010000100101… |
… | …01000001111011000 |
3 | 1020121122221220102200 |
4 | 30020102220033120 |
5 | 203133121044112 |
6 | 5552205330200 |
7 | 640514125215 |
oct | 141022501730 |
9 | 36548856380 |
10 | 13024003032 |
11 | 558378a277 |
12 | 2635866960 |
13 | 12c7357191 |
14 | 8b7a16b0c |
15 | 5135e3cdc |
hex | 3084a83d8 |
13024003032 has 48 divisors (see below), whose sum is σ = 35585517240. Its totient is φ = 4302912768.
The previous prime is 13024003021. The next prime is 13024003043. The reversal of 13024003032 is 23030042031.
It is an interprime number because it is at equal distance from previous prime (13024003021) and next prime (13024003043).
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a junction number, because it is equal to n+sod(n) for n = 13024002996 and 13024003014.
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 11 ways as a sum of consecutive naturals, for example, 792258 + ... + 808529.
Almost surely, 213024003032 is an apocalyptic number.
13024003032 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
13024003032 is an abundant number, since it is smaller than the sum of its proper divisors (22561514208).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13024003032 is a wasteful number, since it uses less digits than its factorization.
13024003032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1600912 (or 1600905 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 18.
Adding to 13024003032 its reverse (23030042031), we get a palindrome (36054045063).
The spelling of 13024003032 in words is "thirteen billion, twenty-four million, three thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •