Base | Representation |
---|---|
bin | 101101101110110101000111… |
… | …100000111001010010110001 |
3 | 222101010212021002012001102001 |
4 | 231232311013200321102301 |
5 | 202330304144131410001 |
6 | 1551433540553254001 |
7 | 60236115301041466 |
oct | 5556650740712261 |
9 | 871125232161361 |
10 | 201130223310001 |
11 | 590a4937671497 |
12 | 1a684474a04301 |
13 | 882c66378842b |
14 | 3794a7d06566d |
15 | 183bcd307a001 |
hex | b6ed478394b1 |
201130223310001 has 2 divisors, whose sum is σ = 201130223310002. Its totient is φ = 201130223310000.
The previous prime is 201130223309999. The next prime is 201130223310011. The reversal of 201130223310001 is 100013322031102.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 184639152063601 + 16491071246400 = 13588199^2 + 4060920^2 .
It is a cyclic number.
It is not a de Polignac number, because 201130223310001 - 21 = 201130223309999 is a prime.
Together with 201130223309999, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (201130223310011) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100565111655000 + 100565111655001.
It is an arithmetic number, because the mean of its divisors is an integer number (100565111655001).
Almost surely, 2201130223310001 is an apocalyptic number.
It is an amenable number.
201130223310001 is a deficient number, since it is larger than the sum of its proper divisors (1).
201130223310001 is an equidigital number, since it uses as much as digits as its factorization.
201130223310001 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 201130223310001 its reverse (100013322031102), we get a palindrome (301143545341103).
The spelling of 201130223310001 in words is "two hundred one trillion, one hundred thirty billion, two hundred twenty-three million, three hundred ten thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •