Base | Representation |
---|---|
bin | 11100100111111… |
… | …010111110010101 |
3 | 1020110122001220101 |
4 | 130213322332111 |
5 | 1440414232341 |
6 | 115352534101 |
7 | 14620602235 |
oct | 3447727625 |
9 | 1213561811 |
10 | 480227221 |
11 | 227091901 |
12 | 1149b1331 |
13 | 78651226 |
14 | 47ac9cc5 |
15 | 2c25e831 |
hex | 1c9faf95 |
480227221 has 2 divisors, whose sum is σ = 480227222. Its totient is φ = 480227220.
The previous prime is 480227191. The next prime is 480227227. The reversal of 480227221 is 122722084.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 364428100 + 115799121 = 19090^2 + 10761^2 .
It is a cyclic number.
It is not a de Polignac number, because 480227221 - 219 = 479702933 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 480227221.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (480227227) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 240113610 + 240113611.
It is an arithmetic number, because the mean of its divisors is an integer number (240113611).
Almost surely, 2480227221 is an apocalyptic number.
It is an amenable number.
480227221 is a deficient number, since it is larger than the sum of its proper divisors (1).
480227221 is an equidigital number, since it uses as much as digits as its factorization.
480227221 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3584, while the sum is 28.
The square root of 480227221 is about 21914.0872728024. The cubic root of 480227221 is about 783.0970559858.
It can be divided in two parts, 4802 and 27221, that added together give a palindrome (32023).
The spelling of 480227221 in words is "four hundred eighty million, two hundred twenty-seven thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •