Base | Representation |
---|---|
bin | 111000010110111… |
… | …1011101010110000 |
3 | 11212210102021112000 |
4 | 1300231323222300 |
5 | 12333104322242 |
6 | 511352334000 |
7 | 64601664135 |
oct | 16055735260 |
9 | 4783367460 |
10 | 1891089072 |
11 | 89051a234 |
12 | 4493a4300 |
13 | 241a33922 |
14 | 13d22858c |
15 | b104ca4c |
hex | 70b7bab0 |
1891089072 has 160 divisors (see below), whose sum is σ = 5860339200. Its totient is φ = 582075648.
The previous prime is 1891089037. The next prime is 1891089091. The reversal of 1891089072 is 2709801981.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 284863 + ... + 291425.
It is an arithmetic number, because the mean of its divisors is an integer number (36627120).
Almost surely, 21891089072 is an apocalyptic number.
1891089072 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 1891089072, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2930169600).
1891089072 is an abundant number, since it is smaller than the sum of its proper divisors (3969250128).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1891089072 is a wasteful number, since it uses less digits than its factorization.
1891089072 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6632 (or 6620 counting only the distinct ones).
The product of its (nonzero) digits is 72576, while the sum is 45.
The square root of 1891089072 is about 43486.6539526784. The cubic root of 1891089072 is about 1236.6230245769.
The spelling of 1891089072 in words is "one billion, eight hundred ninety-one million, eighty-nine thousand, seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •