Base | Representation |
---|---|
bin | 101111110100011… |
… | …011011101100000 |
3 | 2001220121200211021 |
4 | 233310123131200 |
5 | 3120340214440 |
6 | 211335255224 |
7 | 25611131455 |
oct | 5764333540 |
9 | 2056550737 |
10 | 802273120 |
11 | 381953740 |
12 | 1a481a514 |
13 | ca29a72c |
14 | 7879b82c |
15 | 4a67584a |
hex | 2fd1b760 |
802273120 has 96 divisors (see below), whose sum is σ = 2157684480. Its totient is φ = 279037440.
The previous prime is 802273099. The next prime is 802273133. The reversal of 802273120 is 21372208.
It is a congruent number.
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 15 ways as a sum of consecutive naturals, for example, 30571 + ... + 50389.
It is an arithmetic number, because the mean of its divisors is an integer number (22475880).
Almost surely, 2802273120 is an apocalyptic number.
802273120 is a gapful number since it is divisible by the number (80) 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 802273120, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1078842240).
802273120 is an abundant number, since it is smaller than the sum of its proper divisors (1355411360).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
802273120 is a wasteful number, since it uses less digits than its factorization.
802273120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19868 (or 19860 counting only the distinct ones).
The product of its (nonzero) digits is 1344, while the sum is 25.
The square root of 802273120 is about 28324.4262077804. The cubic root of 802273120 is about 929.1961759772.
The spelling of 802273120 in words is "eight hundred two million, two hundred seventy-three thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •