Base | Representation |
---|---|
bin | 1011101001011100000… |
… | …0111100001111011101 |
3 | 201010111110102000002021 |
4 | 2322113000330033131 |
5 | 11234302114230411 |
6 | 231531534300141 |
7 | 20312500542265 |
oct | 2722700741735 |
9 | 633443360067 |
10 | 200102101981 |
11 | 77954468a01 |
12 | 32945957651 |
13 | 15b3c51a652 |
14 | 998389c7a5 |
15 | 53123e1a71 |
hex | 2e9703c3dd |
200102101981 has 2 divisors, whose sum is σ = 200102101982. Its totient is φ = 200102101980.
The previous prime is 200102101961. The next prime is 200102102029. The reversal of 200102101981 is 189101201002.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 157106005956 + 42996096025 = 396366^2 + 207355^2 .
It is a cyclic number.
It is not a de Polignac number, because 200102101981 - 217 = 200101970909 is a prime.
It is a super-2 number, since 2×2001021019812 (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 (200102101961) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100051050990 + 100051050991.
It is an arithmetic number, because the mean of its divisors is an integer number (100051050991).
Almost surely, 2200102101981 is an apocalyptic number.
It is an amenable number.
200102101981 is a deficient number, since it is larger than the sum of its proper divisors (1).
200102101981 is an equidigital number, since it uses as much as digits as its factorization.
200102101981 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 288, while the sum is 25.
Adding to 200102101981 its reverse (189101201002), we get a palindrome (389203302983).
The spelling of 200102101981 in words is "two hundred billion, one hundred two million, one hundred one thousand, nine hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •