Base | Representation |
---|---|
bin | 11101111001011111… |
… | …101110010000010101 |
3 | 10001212022200222112202 |
4 | 131321133232100111 |
5 | 1011221400131013 |
6 | 22425321254245 |
7 | 2214355050404 |
oct | 357137562025 |
9 | 101768628482 |
10 | 32103130133 |
11 | 1268441a908 |
12 | 627b334385 |
13 | 304800a8b9 |
14 | 17a78ab63b |
15 | c7d5ad858 |
hex | 7797ee415 |
32103130133 has 8 divisors (see below), whose sum is σ = 33166530816. Its totient is φ = 31041468000.
The previous prime is 32103130127. The next prime is 32103130139. The reversal of 32103130133 is 33103130123.
It is an interprime number because it is at equal distance from previous prime (32103130127) and next prime (32103130139).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 32103130133 - 212 = 32103126037 is a prime.
It is a super-2 number, since 2×321031301332 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (32103130139) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 397043 + ... + 471008.
It is an arithmetic number, because the mean of its divisors is an integer number (4145816352).
Almost surely, 232103130133 is an apocalyptic number.
It is an amenable number.
32103130133 is a deficient number, since it is larger than the sum of its proper divisors (1063400683).
32103130133 is a wasteful number, since it uses less digits than its factorization.
32103130133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 869275.
The product of its (nonzero) digits is 486, while the sum is 20.
Adding to 32103130133 its reverse (33103130123), we get a palindrome (65206260256).
The spelling of 32103130133 in words is "thirty-two billion, one hundred three million, one hundred thirty thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •