Base | Representation |
---|---|
bin | 11000101000001110… |
… | …01001100000000100 |
3 | 1021010111010110100110 |
4 | 30110013021200010 |
5 | 204034403221012 |
6 | 10024012113020 |
7 | 645442603200 |
oct | 142407114004 |
9 | 37114113313 |
10 | 13222320132 |
11 | 56757228aa |
12 | 2690165770 |
13 | 1329472488 |
14 | 8d60bbb00 |
15 | 525c1973c |
hex | 3141c9804 |
13222320132 has 72 divisors (see below), whose sum is σ = 37449590976. Its totient is φ = 3613549632.
The previous prime is 13222320127. The next prime is 13222320151. The reversal of 13222320132 is 23102322231.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a junction number, because it is equal to n+sod(n) for n = 13222320099 and 13222320108.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 475323 + ... + 502370.
It is an arithmetic number, because the mean of its divisors is an integer number (520133208).
Almost surely, 213222320132 is an apocalyptic number.
13222320132 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
13222320132 is an abundant number, since it is smaller than the sum of its proper divisors (24227270844).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13222320132 is a wasteful number, since it uses less digits than its factorization.
13222320132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 977737 (or 977728 counting only the distinct ones).
The product of its (nonzero) digits is 864, while the sum is 21.
Adding to 13222320132 its reverse (23102322231), we get a palindrome (36324642363).
The spelling of 13222320132 in words is "thirteen billion, two hundred twenty-two million, three hundred twenty thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •