Base | Representation |
---|---|
bin | 101101101110110101000111… |
… | …100000100001010111111111 |
3 | 222101010212021002000002000112 |
4 | 231232311013200201113333 |
5 | 202330304144120241111 |
6 | 1551433540551220235 |
7 | 60236115300153041 |
oct | 5556650740412777 |
9 | 871125232002015 |
10 | 201130223212031 |
11 | 590a4937604923 |
12 | 1a68447497767b |
13 | 882c663752969 |
14 | 3794a7d03ba91 |
15 | 183bcd305ae8b |
hex | b6ed478215ff |
201130223212031 has 2 divisors, whose sum is σ = 201130223212032. Its totient is φ = 201130223212030.
The previous prime is 201130223212007. The next prime is 201130223212043. The reversal of 201130223212031 is 130212322031102.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 201130223212031 - 210 = 201130223211007 is a prime.
It is a super-2 number, since 2×2011302232120312 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 201130223211988 and 201130223212006.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (201130223212001) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100565111606015 + 100565111606016.
It is an arithmetic number, because the mean of its divisors is an integer number (100565111606016).
Almost surely, 2201130223212031 is an apocalyptic number.
201130223212031 is a deficient number, since it is larger than the sum of its proper divisors (1).
201130223212031 is an equidigital number, since it uses as much as digits as its factorization.
201130223212031 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 864, while the sum is 23.
Adding to 201130223212031 its reverse (130212322031102), we get a palindrome (331342545243133).
The spelling of 201130223212031 in words is "two hundred one trillion, one hundred thirty billion, two hundred twenty-three million, two hundred twelve thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •