Base | Representation |
---|---|
bin | 100110110010100… |
… | …0010000000110000 |
3 | 10100201002202100002 |
4 | 1031211002000300 |
5 | 10131144200300 |
6 | 333052445132 |
7 | 44153006513 |
oct | 11545020060 |
9 | 3321082302 |
10 | 1301553200 |
11 | 608769202 |
12 | 303a797a8 |
13 | 17985cc2c |
14 | c4c06d7a |
15 | 793ea5d5 |
hex | 4d942030 |
1301553200 has 120 divisors (see below), whose sum is σ = 3372648720. Its totient is φ = 481075200.
The previous prime is 1301553191. The next prime is 1301553223. The reversal of 1301553200 is 23551031.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 309512 + ... + 313688.
It is an arithmetic number, because the mean of its divisors is an integer number (28105406).
Almost surely, 21301553200 is an apocalyptic number.
1301553200 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 1301553200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1686324360).
1301553200 is an abundant number, since it is smaller than the sum of its proper divisors (2071095520).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1301553200 is a wasteful number, since it uses less digits than its factorization.
1301553200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4255 (or 4244 counting only the distinct ones).
The product of its (nonzero) digits is 450, while the sum is 20.
The square root of 1301553200 is about 36077.0453335636. The cubic root of 1301553200 is about 1091.8273642839.
The spelling of 1301553200 in words is "one billion, three hundred one million, five hundred fifty-three thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •