Base | Representation |
---|---|
bin | 11000101000001110… |
… | …00100100101100000 |
3 | 1021010111002102201211 |
4 | 30110013010211200 |
5 | 204034402100000 |
6 | 10024011435504 |
7 | 645442460410 |
oct | 142407044540 |
9 | 37114072654 |
10 | 13222300000 |
11 | 5675709768 |
12 | 2690155b94 |
13 | 1329466270 |
14 | 8d60b4640 |
15 | 525c137ba |
hex | 3141c4960 |
13222300000 has 288 divisors, whose sum is σ = 40073310144. Its totient is φ = 4181760000.
The previous prime is 13222299997. The next prime is 13222300061. The reversal of 13222300000 is 322231.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (13).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 9099274 + ... + 9100726.
It is an arithmetic number, because the mean of its divisors is an integer number (139143438).
Almost surely, 213222300000 is an apocalyptic number.
13222300000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 13222300000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (20036655072).
13222300000 is an abundant number, since it is smaller than the sum of its proper divisors (26851010144).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13222300000 is an equidigital number, since it uses as much as digits as its factorization.
13222300000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1508 (or 1480 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 13.
Adding to 13222300000 its reverse (322231), we get a palindrome (13222622231).
The spelling of 13222300000 in words is "thirteen billion, two hundred twenty-two million, three hundred thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •