Base | Representation |
---|---|
bin | 100100100000100… |
… | …1100100101101001 |
3 | 10011101011000022202 |
4 | 1021001030211221 |
5 | 10002103103343 |
6 | 321321025545 |
7 | 42233520503 |
oct | 11101144551 |
9 | 3141130282 |
10 | 1225050473 |
11 | 579566609 |
12 | 2a23252b5 |
13 | 166a5564a |
14 | b89b0d73 |
15 | 72837db8 |
hex | 4904c969 |
1225050473 has 2 divisors, whose sum is σ = 1225050474. Its totient is φ = 1225050472.
The previous prime is 1225050397. The next prime is 1225050487. The reversal of 1225050473 is 3740505221.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1009459984 + 215590489 = 31772^2 + 14683^2 .
It is an emirp because it is prime and its reverse (3740505221) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1225050473 - 224 = 1208273257 is a prime.
It is a super-2 number, since 2×12250504732 = 3001497322795047458, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1225050773) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 612525236 + 612525237.
It is an arithmetic number, because the mean of its divisors is an integer number (612525237).
Almost surely, 21225050473 is an apocalyptic number.
It is an amenable number.
1225050473 is a deficient number, since it is larger than the sum of its proper divisors (1).
1225050473 is an equidigital number, since it uses as much as digits as its factorization.
1225050473 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 8400, while the sum is 29.
The square root of 1225050473 is about 35000.7210354301. The cubic root of 1225050473 is about 1070.0021757314.
Adding to 1225050473 its reverse (3740505221), we get a palindrome (4965555694).
The spelling of 1225050473 in words is "one billion, two hundred twenty-five million, fifty thousand, four hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •