Base | Representation |
---|---|
bin | 101101011110100011111000… |
… | …101111000010010100111001 |
3 | 222020011222110211010102100211 |
4 | 231132203320233002110321 |
5 | 202204000001242314433 |
6 | 1545220201342431121 |
7 | 60062256010525135 |
oct | 5536437057022471 |
9 | 866158424112324 |
10 | 200012210119993 |
11 | 5880377a33a207 |
12 | 1a5238585924a1 |
13 | 877b0bbb1205b |
14 | 37568dd4da3c5 |
15 | 181cb9aeb78cd |
hex | b5e8f8bc2539 |
200012210119993 has 2 divisors, whose sum is σ = 200012210119994. Its totient is φ = 200012210119992.
The previous prime is 200012210119991. The next prime is 200012210120017. The reversal of 200012210119993 is 399911012210002.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 155726738818704 + 44285471301289 = 12479052^2 + 6654733^2 .
It is a cyclic number.
It is not a de Polignac number, because 200012210119993 - 21 = 200012210119991 is a prime.
Together with 200012210119991, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (200012210119991) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100006105059996 + 100006105059997.
It is an arithmetic number, because the mean of its divisors is an integer number (100006105059997).
Almost surely, 2200012210119993 is an apocalyptic number.
It is an amenable number.
200012210119993 is a deficient number, since it is larger than the sum of its proper divisors (1).
200012210119993 is an equidigital number, since it uses as much as digits as its factorization.
200012210119993 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 17496, while the sum is 40.
Adding to 200012210119993 its reverse (399911012210002), we get a palindrome (599923222329995).
The spelling of 200012210119993 in words is "two hundred trillion, twelve billion, two hundred ten million, one hundred nineteen thousand, nine hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •