Base | Representation |
---|---|
bin | 1101001111011001010… |
… | …0010001100110110001 |
3 | 210202010211110101210002 |
4 | 3103312110101212301 |
5 | 12211330011401041 |
6 | 252255412515345 |
7 | 22301636656454 |
oct | 3236624214661 |
9 | 722124411702 |
10 | 227470809521 |
11 | 88519383a6a |
12 | 3810361bb55 |
13 | 185b1704457 |
14 | b01c67b49b |
15 | 5db500859b |
hex | 34f65119b1 |
227470809521 has 2 divisors, whose sum is σ = 227470809522. Its totient is φ = 227470809520.
The previous prime is 227470809499. The next prime is 227470809541. The reversal of 227470809521 is 125908074722.
227470809521 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 128583202225 + 98887607296 = 358585^2 + 314464^2 .
It is a cyclic number.
It is not a de Polignac number, because 227470809521 - 210 = 227470808497 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (227470809541) 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, 113735404760 + 113735404761.
It is an arithmetic number, because the mean of its divisors is an integer number (113735404761).
Almost surely, 2227470809521 is an apocalyptic number.
It is an amenable number.
227470809521 is a deficient number, since it is larger than the sum of its proper divisors (1).
227470809521 is an equidigital number, since it uses as much as digits as its factorization.
227470809521 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 564480, while the sum is 47.
The spelling of 227470809521 in words is "two hundred twenty-seven billion, four hundred seventy million, eight hundred nine thousand, five hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •