Base | Representation |
---|---|
bin | 111100010100101… |
… | …011110010100001 |
3 | 2121112100201201222 |
4 | 330110223302201 |
5 | 4033041231301 |
6 | 244231504425 |
7 | 34036220153 |
oct | 7424536241 |
9 | 2545321658 |
10 | 1012055201 |
11 | 47a308063 |
12 | 242b28115 |
13 | 13189b341 |
14 | 985a8ad3 |
15 | 5dcb331b |
hex | 3c52bca1 |
1012055201 has 2 divisors, whose sum is σ = 1012055202. Its totient is φ = 1012055200.
The previous prime is 1012055173. The next prime is 1012055227. The reversal of 1012055201 is 1025502101.
1012055201 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., 792985600 + 219069601 = 28160^2 + 14801^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1012055201 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1012055201.
It is not a weakly prime, because it can be changed into another prime (1012055251) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 506027600 + 506027601.
It is an arithmetic number, because the mean of its divisors is an integer number (506027601).
Almost surely, 21012055201 is an apocalyptic number.
It is an amenable number.
1012055201 is a deficient number, since it is larger than the sum of its proper divisors (1).
1012055201 is an equidigital number, since it uses as much as digits as its factorization.
1012055201 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 100, while the sum is 17.
The square root of 1012055201 is about 31812.8150436267. The cubic root of 1012055201 is about 1004.0023600760.
Adding to 1012055201 its reverse (1025502101), we get a palindrome (2037557302).
The spelling of 1012055201 in words is "one billion, twelve million, fifty-five thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.210 sec. • engine limits •