Base | Representation |
---|---|
bin | 1001100010010… |
… | …11110010011001 |
3 | 12120112112101111 |
4 | 10301023302121 |
5 | 130440032301 |
6 | 11534420321 |
7 | 1661002366 |
oct | 461136231 |
9 | 176475344 |
10 | 80002201 |
11 | 41182924 |
12 | 229616a1 |
13 | 137613a6 |
14 | a8a746d |
15 | 7054551 |
hex | 4c4bc99 |
80002201 has 4 divisors (see below), whose sum is σ = 80794404. Its totient is φ = 79210000.
The previous prime is 80002199. The next prime is 80002207. The reversal of 80002201 is 10220008.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 79192201 + 810000 = 8899^2 + 900^2 .
It is a cyclic number.
It is not a de Polignac number, because 80002201 - 21 = 80002199 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (80002207) by changing a digit.
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 3 ways as a sum of consecutive naturals, for example, 395950 + ... + 396151.
It is an arithmetic number, because the mean of its divisors is an integer number (20198601).
Almost surely, 280002201 is an apocalyptic number.
It is an amenable number.
80002201 is a deficient number, since it is larger than the sum of its proper divisors (792203).
80002201 is a wasteful number, since it uses less digits than its factorization.
80002201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 792202.
The product of its (nonzero) digits is 32, while the sum is 13.
The square root of 80002201 is about 8944.3949487934. The cubic root of 80002201 is about 430.8908895624.
Adding to 80002201 its reverse (10220008), we get a palindrome (90222209).
It can be divided in two parts, 8000 and 2201, that added together give a palindrome (10201).
The spelling of 80002201 in words is "eighty million, two thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •