Base | Representation |
---|---|
bin | 101101101110110001110100… |
… | …010100010111001010010001 |
3 | 222101010112010010212212121101 |
4 | 231232301310110113022101 |
5 | 202330224420042010024 |
6 | 1551432153220424401 |
7 | 60235631424501553 |
oct | 5556616424271221 |
9 | 871115103785541 |
10 | 201126680031889 |
11 | 590a3389575177 |
12 | 1a683846248101 |
13 | 882c21a678171 |
14 | 379482463d4d3 |
15 | 183bb76e6ec44 |
hex | b6ec74517291 |
201126680031889 has 2 divisors, whose sum is σ = 201126680031890. Its totient is φ = 201126680031888.
The previous prime is 201126680031881. The next prime is 201126680031913. The reversal of 201126680031889 is 988130086621102.
It is a happy number.
201126680031889 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 can be written as a sum of positive squares in only one way, i.e., 147108589941889 + 54018090090000 = 12128833^2 + 7349700^2 .
It is a cyclic number.
It is not a de Polignac number, because 201126680031889 - 23 = 201126680031881 is a prime.
It is not a weakly prime, because it can be changed into another prime (201126680031881) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100563340015944 + 100563340015945.
It is an arithmetic number, because the mean of its divisors is an integer number (100563340015945).
Almost surely, 2201126680031889 is an apocalyptic number.
It is an amenable number.
201126680031889 is a deficient number, since it is larger than the sum of its proper divisors (1).
201126680031889 is an equidigital number, since it uses as much as digits as its factorization.
201126680031889 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1990656, while the sum is 55.
The spelling of 201126680031889 in words is "two hundred one trillion, one hundred twenty-six billion, six hundred eighty million, thirty-one thousand, eight hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •