Base | Representation |
---|---|
bin | 101101011110101100000100… |
… | …110001110010001000001001 |
3 | 222020012211011112210100022112 |
4 | 231132230010301302020021 |
5 | 202204121003014220012 |
6 | 1545224214013232105 |
7 | 60063016616243441 |
oct | 5536540461621011 |
9 | 866184145710275 |
10 | 200021002101257 |
11 | 58807481170927 |
12 | 1a5254b0a92635 |
13 | 877bb9045b22c |
14 | 37570d5043121 |
15 | 181d012ca4122 |
hex | b5eb04c72209 |
200021002101257 has 2 divisors, whose sum is σ = 200021002101258. Its totient is φ = 200021002101256.
The previous prime is 200021002101187. The next prime is 200021002101269. The reversal of 200021002101257 is 752101200120002.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 101954841258361 + 98066160842896 = 10097269^2 + 9902836^2 .
It is a cyclic number.
It is not a de Polignac number, because 200021002101257 - 210 = 200021002100233 is a prime.
It is not a weakly prime, because it can be changed into another prime (200021002101857) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100010501050628 + 100010501050629.
It is an arithmetic number, because the mean of its divisors is an integer number (100010501050629).
Almost surely, 2200021002101257 is an apocalyptic number.
It is an amenable number.
200021002101257 is a deficient number, since it is larger than the sum of its proper divisors (1).
200021002101257 is an equidigital number, since it uses as much as digits as its factorization.
200021002101257 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 560, while the sum is 23.
Adding to 200021002101257 its reverse (752101200120002), we get a palindrome (952122202221259).
The spelling of 200021002101257 in words is "two hundred trillion, twenty-one billion, two million, one hundred one thousand, two hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.130 sec. • engine limits •