Base | Representation |
---|---|
bin | 11101111011001110… |
… | …111111110011101101 |
3 | 10001221100120222002200 |
4 | 131323032333303231 |
5 | 1011301332100023 |
6 | 22432242412113 |
7 | 2215161020652 |
oct | 357316776355 |
9 | 101840528080 |
10 | 32132300013 |
11 | 12699933650 |
12 | 6289061039 |
13 | 3051081a98 |
14 | 17ab701c29 |
15 | c80e21743 |
hex | 77b3bfced |
32132300013 has 48 divisors (see below), whose sum is σ = 51936181440. Its totient is φ = 18974995200.
The previous prime is 32132300009. The next prime is 32132300027. The reversal of 32132300013 is 31000323123.
32132300013 is a `hidden beast` number, since 321 + 32 + 300 + 0 + 13 = 666.
It is not a de Polignac number, because 32132300013 - 22 = 32132300009 is a prime.
It is a super-3 number, since 3×321323000133 (a number of 32 digits) contains 333 as substring.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (32132300003) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 1783233 + ... + 1801161.
It is an arithmetic number, because the mean of its divisors is an integer number (1082003780).
Almost surely, 232132300013 is an apocalyptic number.
32132300013 is a gapful number since it is divisible by the number (33) formed by its first and last digit.
It is an amenable number.
32132300013 is a deficient number, since it is larger than the sum of its proper divisors (19803881427).
32132300013 is a wasteful number, since it uses less digits than its factorization.
32132300013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 18410 (or 18407 counting only the distinct ones).
The product of its (nonzero) digits is 324, while the sum is 18.
Adding to 32132300013 its reverse (31000323123), we get a palindrome (63132623136).
The spelling of 32132300013 in words is "thirty-two billion, one hundred thirty-two million, three hundred thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •