Base | Representation |
---|---|
bin | 100011110001001… |
… | …1000011000000000 |
3 | 10002122101020010100 |
4 | 1013202120120000 |
5 | 4424222220242 |
6 | 315032202400 |
7 | 41512326666 |
oct | 10742303000 |
9 | 3078336110 |
10 | 1200195072 |
11 | 56652a35a |
12 | 295b39400 |
13 | 1618621cb |
14 | b5580c36 |
15 | 7057854c |
hex | 47898600 |
1200195072 has 120 divisors (see below), whose sum is σ = 3485401920. Its totient is φ = 397578240.
The previous prime is 1200195071. The next prime is 1200195079. The reversal of 1200195072 is 2705910021.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1200195071) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 833329 + ... + 834767.
It is an arithmetic number, because the mean of its divisors is an integer number (29045016).
Almost surely, 21200195072 is an apocalyptic number.
1200195072 is a gapful number since it is divisible by the number (12) 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 1200195072, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1742700960).
1200195072 is an abundant number, since it is smaller than the sum of its proper divisors (2285206848).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1200195072 is a wasteful number, since it uses less digits than its factorization.
1200195072 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1644 (or 1625 counting only the distinct ones).
The product of its (nonzero) digits is 1260, while the sum is 27.
The square root of 1200195072 is about 34643.8316587528. The cubic root of 1200195072 is about 1062.7161479884.
The spelling of 1200195072 in words is "one billion, two hundred million, one hundred ninety-five thousand, seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.123 sec. • engine limits •