Base | Representation |
---|---|
bin | 11110000000101001… |
… | …011101001010010000 |
3 | 10002011200111012112100 |
4 | 132000221131022100 |
5 | 1011443104401224 |
6 | 22445245200400 |
7 | 2220343006200 |
oct | 360051351220 |
9 | 102150435470 |
10 | 32223122064 |
11 | 127361265a1 |
12 | 62b3560100 |
13 | 3066b30c43 |
14 | 17b97c4400 |
15 | c88db1ac9 |
hex | 780a5d290 |
32223122064 has 135 divisors (see below), whose sum is σ = 104952362697. Its totient is φ = 9202298112.
The previous prime is 32223122053. The next prime is 32223122159. The reversal of 32223122064 is 46022132223.
It is a happy number.
The square root of 32223122064 is 179508.
It is a perfect power (a square), and thus also a powerful number.
32223122064 is a `hidden beast` number, since 322 + 2 + 312 + 20 + 6 + 4 = 666.
It can be written as a sum of positive squares in only one way, i.e., 1460768400 + 30762353664 = 38220^2 + 175392^2 .
It is an unprimeable number.
It is a polite number, since it can be written in 26 ways as a sum of consecutive naturals, for example, 15077604 + ... + 15079740.
Almost surely, 232223122064 is an apocalyptic number.
32223122064 is the 179508-th square number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 32223122064
32223122064 is an abundant number, since it is smaller than the sum of its proper divisors (72729240633).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
32223122064 is an equidigital number, since it uses as much as digits as its factorization.
32223122064 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4302 (or 2149 counting only the distinct ones).
The product of its (nonzero) digits is 6912, while the sum is 27.
Adding to 32223122064 its reverse (46022132223), we get a palindrome (78245254287).
The spelling of 32223122064 in words is "thirty-two billion, two hundred twenty-three million, one hundred twenty-two thousand, sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •