Base | Representation |
---|---|
bin | 1011110000111111101… |
… | …0010010011110011101 |
3 | 201022201211000021111212 |
4 | 2330033322102132131 |
5 | 11302430340314211 |
6 | 232505111554205 |
7 | 20413660030112 |
oct | 2741772223635 |
9 | 638654007455 |
10 | 202130401181 |
11 | 787a5384135 |
12 | 3321108b965 |
13 | 160a37c27a7 |
14 | 9ad7002909 |
15 | 53d04e438b |
hex | 2f0fe9279d |
202130401181 has 2 divisors, whose sum is σ = 202130401182. Its totient is φ = 202130401180.
The previous prime is 202130401171. The next prime is 202130401243. The reversal of 202130401181 is 181104031202.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 145443076900 + 56687324281 = 381370^2 + 238091^2 .
It is a cyclic number.
It is not a de Polignac number, because 202130401181 - 218 = 202130139037 is a prime.
It is a super-2 number, since 2×2021304011812 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (202130401171) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 101065200590 + 101065200591.
It is an arithmetic number, because the mean of its divisors is an integer number (101065200591).
Almost surely, 2202130401181 is an apocalyptic number.
It is an amenable number.
202130401181 is a deficient number, since it is larger than the sum of its proper divisors (1).
202130401181 is an equidigital number, since it uses as much as digits as its factorization.
202130401181 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 384, while the sum is 23.
Adding to 202130401181 its reverse (181104031202), we get a palindrome (383234432383).
The spelling of 202130401181 in words is "two hundred two billion, one hundred thirty million, four hundred one thousand, one hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •