Base | Representation |
---|---|
bin | 101101111100111100011010… |
… | …100101110011101110000111 |
3 | 222111120120202200221100002022 |
4 | 231330330122211303232013 |
5 | 202442202032322411241 |
6 | 1553455304035433355 |
7 | 60366152451616403 |
oct | 5574743245635607 |
9 | 874516680840068 |
10 | 202100132232071 |
11 | 594392039a6137 |
12 | 1a80043945585b |
13 | 889cc648503c8 |
14 | 37c99acd16103 |
15 | 185714cbc654b |
hex | b7cf1a973b87 |
202100132232071 has 2 divisors, whose sum is σ = 202100132232072. Its totient is φ = 202100132232070.
The previous prime is 202100132232067. The next prime is 202100132232311. The reversal of 202100132232071 is 170232231001202.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 202100132232071 - 22 = 202100132232067 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 202100132232071.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (202100132232671) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 101050066116035 + 101050066116036.
It is an arithmetic number, because the mean of its divisors is an integer number (101050066116036).
Almost surely, 2202100132232071 is an apocalyptic number.
202100132232071 is a deficient number, since it is larger than the sum of its proper divisors (1).
202100132232071 is an equidigital number, since it uses as much as digits as its factorization.
202100132232071 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2016, while the sum is 26.
Adding to 202100132232071 its reverse (170232231001202), we get a palindrome (372332363233273).
The spelling of 202100132232071 in words is "two hundred two trillion, one hundred billion, one hundred thirty-two million, two hundred thirty-two thousand, seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •