Base | Representation |
---|---|
bin | 1011110000111011000… |
… | …0101010110011000011 |
3 | 201022200110200210012211 |
4 | 2330032300222303003 |
5 | 11302410420232042 |
6 | 232503142202551 |
7 | 20413334010523 |
oct | 2741660526303 |
9 | 638613623184 |
10 | 202111102147 |
11 | 787954a2519 |
12 | 33206723457 |
13 | 1609c7c6446 |
14 | 9ad461b683 |
15 | 53cd981017 |
hex | 2f0ec2acc3 |
202111102147 has 2 divisors, whose sum is σ = 202111102148. Its totient is φ = 202111102146.
The previous prime is 202111102117. The next prime is 202111102183. The reversal of 202111102147 is 741201111202.
It is a happy number.
202111102147 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 is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-202111102147 is a prime.
It is a super-2 number, since 2×2021111021472 (a number of 23 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (202111102117) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 101055551073 + 101055551074.
It is an arithmetic number, because the mean of its divisors is an integer number (101055551074).
Almost surely, 2202111102147 is an apocalyptic number.
202111102147 is a deficient number, since it is larger than the sum of its proper divisors (1).
202111102147 is an equidigital number, since it uses as much as digits as its factorization.
202111102147 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 224, while the sum is 22.
Adding to 202111102147 its reverse (741201111202), we get a palindrome (943312213349).
The spelling of 202111102147 in words is "two hundred two billion, one hundred eleven million, one hundred two thousand, one hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •