Base | Representation |
---|---|
bin | 11000101000000100… |
… | …00111110001011000 |
3 | 1021010101122111122220 |
4 | 30110002013301120 |
5 | 204034034033303 |
6 | 10023523544040 |
7 | 645425444202 |
oct | 142402076130 |
9 | 37111574586 |
10 | 13221002328 |
11 | 5674a02806 |
12 | 268b82b020 |
13 | 1329100701 |
14 | 8d5c57772 |
15 | 525a59053 |
hex | 314087c58 |
13221002328 has 64 divisors (see below), whose sum is σ = 34208352000. Its totient is φ = 4253031552.
The previous prime is 13221002317. The next prime is 13221002329. The reversal of 13221002328 is 82320012231.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is a junction number, because it is equal to n+sod(n) for n = 13221002298 and 13221002307.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13221002329) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2410293 + ... + 2415771.
It is an arithmetic number, because the mean of its divisors is an integer number (534505500).
Almost surely, 213221002328 is an apocalyptic number.
It is an amenable number.
13221002328 is an abundant number, since it is smaller than the sum of its proper divisors (20987349672).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13221002328 is a wasteful number, since it uses less digits than its factorization.
13221002328 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8984 (or 8980 counting only the distinct ones).
The product of its (nonzero) digits is 1152, while the sum is 24.
Adding to 13221002328 its reverse (82320012231), we get a palindrome (95541014559).
The spelling of 13221002328 in words is "thirteen billion, two hundred twenty-one million, two thousand, three hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •