Base | Representation |
---|---|
bin | 111101000110110… |
… | …0010111000000000 |
3 | 12021220010122100100 |
4 | 1322031202320000 |
5 | 13144343333242 |
6 | 535242322400 |
7 | 101544603141 |
oct | 17215427000 |
9 | 5256118310 |
10 | 2050371072 |
11 | 962421152 |
12 | 4927b9400 |
13 | 268a32629 |
14 | 15644bac8 |
15 | c001254c |
hex | 7a362e00 |
2050371072 has 120 divisors (see below), whose sum is σ = 5936673600. Its totient is φ = 681246720.
The previous prime is 2050371049. The next prime is 2050371097. The reversal of 2050371072 is 2701730502.
2050371072 is a `hidden beast` number, since 20 + 503 + 71 + 0 + 72 = 666.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 2068497 + ... + 2069487.
It is an arithmetic number, because the mean of its divisors is an integer number (49472280).
Almost surely, 22050371072 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2050371072, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2968336800).
2050371072 is an abundant number, since it is smaller than the sum of its proper divisors (3886302528).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2050371072 is an equidigital number, since it uses as much as digits as its factorization.
2050371072 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1464 (or 1445 counting only the distinct ones).
The product of its (nonzero) digits is 2940, while the sum is 27.
The square root of 2050371072 is about 45281.0233099916. The cubic root of 2050371072 is about 1270.4107361828.
The spelling of 2050371072 in words is "two billion, fifty million, three hundred seventy-one thousand, seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •