Base | Representation |
---|---|
bin | 1001100011111… |
… | …10110100010110 |
3 | 12120221011010000 |
4 | 10301332310112 |
5 | 131013224342 |
6 | 11543112130 |
7 | 1662532650 |
oct | 461766426 |
9 | 176834100 |
10 | 80211222 |
11 | 41305973 |
12 | 22a42646 |
13 | 13805580 |
14 | a91d6d0 |
15 | 709644c |
hex | 4c7ed16 |
80211222 has 80 divisors (see below), whose sum is σ = 221249952. Its totient is φ = 21150720.
The previous prime is 80211221. The next prime is 80211223. The reversal of 80211222 is 22211208.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (80211221) and next prime (80211223).
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a junction number, because it is equal to n+sod(n) for n = 80211195 and 80211204.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (80211221) by changing a digit.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 12022 + ... + 17462.
Almost surely, 280211222 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 80211222, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (110624976).
80211222 is an abundant number, since it is smaller than the sum of its proper divisors (141038730).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
80211222 is a wasteful number, since it uses less digits than its factorization.
80211222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5475 (or 5466 counting only the distinct ones).
The product of its (nonzero) digits is 128, while the sum is 18.
The square root of 80211222 is about 8956.0717951566. The cubic root of 80211222 is about 431.2658247501.
The spelling of 80211222 in words is "eighty million, two hundred eleven thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.102 sec. • engine limits •