Base | Representation |
---|---|
bin | 111100011101000… |
… | …011100010000001 |
3 | 2121200111012220001 |
4 | 330131003202001 |
5 | 4034121441401 |
6 | 244350520001 |
7 | 34063656631 |
oct | 7435034201 |
9 | 2550435801 |
10 | 1014249601 |
11 | 480576812 |
12 | 243806001 |
13 | 1321890c1 |
14 | 989ba6c1 |
15 | 5e098601 |
hex | 3c743881 |
1014249601 has 2 divisors, whose sum is σ = 1014249602. Its totient is φ = 1014249600.
The previous prime is 1014249527. The next prime is 1014249611. The reversal of 1014249601 is 1069424101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 682463376 + 331786225 = 26124^2 + 18215^2 .
It is a cyclic number.
It is not a de Polignac number, because 1014249601 - 219 = 1013725313 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1014249601.
It is not a weakly prime, because it can be changed into another prime (1014249611) 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 as a sum of consecutive naturals, namely, 507124800 + 507124801.
It is an arithmetic number, because the mean of its divisors is an integer number (507124801).
Almost surely, 21014249601 is an apocalyptic number.
It is an amenable number.
1014249601 is a deficient number, since it is larger than the sum of its proper divisors (1).
1014249601 is an equidigital number, since it uses as much as digits as its factorization.
1014249601 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1728, while the sum is 28.
The square root of 1014249601 is about 31847.2856143188. The cubic root of 1014249601 is about 1004.7274826891.
The spelling of 1014249601 in words is "one billion, fourteen million, two hundred forty-nine thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •