Base | Representation |
---|---|
bin | 11101111111100001… |
… | …010111001010011101 |
3 | 10002010100221001001221 |
4 | 131333201113022131 |
5 | 1011423240120013 |
6 | 22443332133341 |
7 | 2220023244235 |
oct | 357741271235 |
9 | 102110831057 |
10 | 32204223133 |
11 | 12726498545 |
12 | 62a9167251 |
13 | 3062c44a44 |
14 | 17b70a4cc5 |
15 | c873cc08d |
hex | 77f85729d |
32204223133 has 8 divisors (see below), whose sum is σ = 33240819200. Its totient is φ = 31176375120.
The previous prime is 32204223127. The next prime is 32204223143. The reversal of 32204223133 is 33132240223.
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 32204223133 - 221 = 32202125981 is a prime.
It is a super-2 number, since 2×322042231332 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 32204223098 and 32204223107.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (32204223143) 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, 2179533 + ... + 2194258.
It is an arithmetic number, because the mean of its divisors is an integer number (4155102400).
Almost surely, 232204223133 is an apocalyptic number.
It is an amenable number.
32204223133 is a deficient number, since it is larger than the sum of its proper divisors (1036596067).
32204223133 is a wasteful number, since it uses less digits than its factorization.
32204223133 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4374027.
The product of its (nonzero) digits is 5184, while the sum is 25.
Adding to 32204223133 its reverse (33132240223), we get a palindrome (65336463356).
The spelling of 32204223133 in words is "thirty-two billion, two hundred four million, two hundred twenty-three thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •