Base | Representation |
---|---|
bin | 101101100000000001000110… |
… | …101011010101101010111111 |
3 | 222020112112211101200211112001 |
4 | 231200001012223111222333 |
5 | 202212114443304140221 |
6 | 1545334153351323131 |
7 | 60102431251615411 |
oct | 5540010653255277 |
9 | 866475741624461 |
10 | 200112302021311 |
11 | 58842172635109 |
12 | 1a53b1310804a7 |
13 | 878768068ac74 |
14 | 375b6b68409b1 |
15 | 18205a8307391 |
hex | b60046ad5abf |
200112302021311 has 2 divisors, whose sum is σ = 200112302021312. Its totient is φ = 200112302021310.
The previous prime is 200112302021309. The next prime is 200112302021341. The reversal of 200112302021311 is 113120203211002.
200112302021311 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 200112302021311 - 21 = 200112302021309 is a prime.
Together with 200112302021309, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (200112302021341) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100056151010655 + 100056151010656.
It is an arithmetic number, because the mean of its divisors is an integer number (100056151010656).
Almost surely, 2200112302021311 is an apocalyptic number.
200112302021311 is a deficient number, since it is larger than the sum of its proper divisors (1).
200112302021311 is an equidigital number, since it uses as much as digits as its factorization.
200112302021311 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 144, while the sum is 19.
Adding to 200112302021311 its reverse (113120203211002), we get a palindrome (313232505232313).
The spelling of 200112302021311 in words is "two hundred trillion, one hundred twelve billion, three hundred two million, twenty-one thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •