Base | Representation |
---|---|
bin | 111100011111111… |
… | …0101110001000001 |
3 | 12020110210202011021 |
4 | 1320333311301001 |
5 | 13124140014332 |
6 | 533233545441 |
7 | 101206503616 |
oct | 17077656101 |
9 | 5213722137 |
10 | 2030001217 |
11 | 951978a62 |
12 | 487a15281 |
13 | 26474ca6a |
14 | 15386850d |
15 | bd33bc97 |
hex | 78ff5c41 |
2030001217 has 2 divisors, whose sum is σ = 2030001218. Its totient is φ = 2030001216.
The previous prime is 2030001191. The next prime is 2030001271. The reversal of 2030001217 is 7121000302.
It is a happy number.
Together with next prime (2030001271) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1944457216 + 85544001 = 44096^2 + 9249^2 .
It is a cyclic number.
It is not a de Polignac number, because 2030001217 - 223 = 2021612609 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 2030001217.
It is not a weakly prime, because it can be changed into another prime (2030001277) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1015000608 + 1015000609.
It is an arithmetic number, because the mean of its divisors is an integer number (1015000609).
Almost surely, 22030001217 is an apocalyptic number.
It is an amenable number.
2030001217 is a deficient number, since it is larger than the sum of its proper divisors (1).
2030001217 is an equidigital number, since it uses as much as digits as its factorization.
2030001217 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 84, while the sum is 16.
The square root of 2030001217 is about 45055.5348098322. The cubic root of 2030001217 is about 1266.1896700353.
Adding to 2030001217 its reverse (7121000302), we get a palindrome (9151001519).
The spelling of 2030001217 in words is "two billion, thirty million, one thousand, two hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •