Base | Representation |
---|---|
bin | 11110010001111011… |
… | …011010011011010101 |
3 | 10002220220000200002200 |
4 | 132101323122123111 |
5 | 1013041314322013 |
6 | 22534123155113 |
7 | 2230463204205 |
oct | 362173323325 |
9 | 102826020080 |
10 | 32513042133 |
11 | 12874845860 |
12 | 6374675a99 |
13 | 30b1c0c990 |
14 | 18060d2405 |
15 | ca457de73 |
hex | 791eda6d5 |
32513042133 has 24 divisors (see below), whose sum is σ = 55173649440. Its totient is φ = 18189113760.
The previous prime is 32513042101. The next prime is 32513042161. The reversal of 32513042133 is 33124031523.
32513042133 is a `hidden beast` number, since 325 + 1 + 304 + 2 + 1 + 33 = 666.
It is not a de Polignac number, because 32513042133 - 25 = 32513042101 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 32513042097 and 32513042106.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (32513042183) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 12630043 + ... + 12632616.
It is an arithmetic number, because the mean of its divisors is an integer number (2298902060).
Almost surely, 232513042133 is an apocalyptic number.
32513042133 is a gapful number since it is divisible by the number (33) formed by its first and last digit.
It is an amenable number.
32513042133 is a deficient number, since it is larger than the sum of its proper divisors (22660607307).
32513042133 is a wasteful number, since it uses less digits than its factorization.
32513042133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25262689 (or 25262686 counting only the distinct ones).
The product of its (nonzero) digits is 6480, while the sum is 27.
Adding to 32513042133 its reverse (33124031523), we get a palindrome (65637073656).
The spelling of 32513042133 in words is "thirty-two billion, five hundred thirteen million, forty-two thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •