Base | Representation |
---|---|
bin | 11000101000010001… |
… | …01100011000000000 |
3 | 1021010111220000220000 |
4 | 30110020230120000 |
5 | 204040004200440 |
6 | 10024024520000 |
7 | 645446211003 |
oct | 142410543000 |
9 | 37114800800 |
10 | 13222725120 |
11 | 567597a100 |
12 | 2690320000 |
13 | 1329584907 |
14 | 8d618553a |
15 | 525c99730 |
hex | 31422c600 |
13222725120 has 1200 divisors, whose sum is σ = 56896608384. Its totient is φ = 2919628800.
The previous prime is 13222725091. The next prime is 13222725127. The reversal of 13222725120 is 2152722231.
13222725120 is a `hidden beast` number, since 1 + 322 + 272 + 51 + 20 = 666.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13222725127) by changing a digit.
It is a polite number, since it can be written in 119 ways as a sum of consecutive naturals, for example, 426539505 + ... + 426539535.
Almost surely, 213222725120 is an apocalyptic number.
13222725120 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 13222725120, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (28448304192).
13222725120 is an abundant number, since it is smaller than the sum of its proper divisors (43673883264).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13222725120 is a wasteful number, since it uses less digits than its factorization.
13222725120 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 105 (or 69 counting only the distinct ones).
The product of its (nonzero) digits is 3360, while the sum is 27.
The spelling of 13222725120 in words is "thirteen billion, two hundred twenty-two million, seven hundred twenty-five thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •