Base | Representation |
---|---|
bin | 11000001110000101… |
… | …01000011001000101 |
3 | 1020120012111110202201 |
4 | 30013002220121011 |
5 | 203112234012013 |
6 | 5550140034501 |
7 | 640140643450 |
oct | 140702503105 |
9 | 36505443681 |
10 | 13003032133 |
11 | 5572966553 |
12 | 262a832a31 |
13 | 12c2bc3b70 |
14 | 8b4d18497 |
15 | 5118503dd |
hex | 3070a8645 |
13003032133 has 16 divisors (see below), whose sum is σ = 16013858560. Its totient is φ = 10281603456.
The previous prime is 13003032127. The next prime is 13003032143. The reversal of 13003032133 is 33123030031.
It is a cyclic number.
It is not a de Polignac number, because 13003032133 - 229 = 12466161221 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 13003032133.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13003032113) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 102016 + ... + 190822.
It is an arithmetic number, because the mean of its divisors is an integer number (1000866160).
Almost surely, 213003032133 is an apocalyptic number.
13003032133 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
13003032133 is a deficient number, since it is larger than the sum of its proper divisors (3010826427).
13003032133 is a wasteful number, since it uses less digits than its factorization.
13003032133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 90436.
The product of its (nonzero) digits is 486, while the sum is 19.
Adding to 13003032133 its reverse (33123030031), we get a palindrome (46126062164).
The spelling of 13003032133 in words is "thirteen billion, three million, thirty-two thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •