Base | Representation |
---|---|
bin | 11101000110101001010… |
… | …110110011011111011001 |
3 | 21002012100111221202121121 |
4 | 131012221112303133121 |
5 | 230232000241321332 |
6 | 4130442101005241 |
7 | 264331615012012 |
oct | 35065126633731 |
9 | 7065314852547 |
10 | 2000001120217 |
11 | 701217546491 |
12 | 2837443b3821 |
13 | 1167a3867219 |
14 | 6cb2caa2009 |
15 | 3705814e797 |
hex | 1d1a95b37d9 |
2000001120217 has 2 divisors, whose sum is σ = 2000001120218. Its totient is φ = 2000001120216.
The previous prime is 2000001120197. The next prime is 2000001120253. The reversal of 2000001120217 is 7120211000002.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1891384076176 + 108617044041 = 1375276^2 + 329571^2 .
It is a cyclic number.
It is not a de Polignac number, because 2000001120217 - 215 = 2000001087449 is a prime.
It is a super-2 number, since 2×20000011202172 (a number of 25 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 2000001120217.
It is not a weakly prime, because it can be changed into another prime (2000001190217) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1000000560108 + 1000000560109.
It is an arithmetic number, because the mean of its divisors is an integer number (1000000560109).
Almost surely, 22000001120217 is an apocalyptic number.
It is an amenable number.
2000001120217 is a deficient number, since it is larger than the sum of its proper divisors (1).
2000001120217 is an equidigital number, since it uses as much as digits as its factorization.
2000001120217 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 56, while the sum is 16.
Adding to 2000001120217 its reverse (7120211000002), we get a palindrome (9120212120219).
The spelling of 2000001120217 in words is "two trillion, one million, one hundred twenty thousand, two hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •