Base | Representation |
---|---|
bin | 10111001111001101100101… |
… | …000010101001101011000010 |
3 | 111101212021012112011002122212 |
4 | 113033031211002221223002 |
5 | 101343423001123031424 |
6 | 1001210122423302122 |
7 | 30345511140433241 |
oct | 2717154502515302 |
9 | 441767175132585 |
10 | 102200442002114 |
11 | 2a622a67171965 |
12 | b5671692aa942 |
13 | 45045ca4559a1 |
14 | 1b3475635c958 |
15 | bc370493010e |
hex | 5cf3650a9ac2 |
102200442002114 has 4 divisors (see below), whose sum is σ = 153300663003174. Its totient is φ = 51100221001056.
The previous prime is 102200442002089. The next prime is 102200442002117. The reversal of 102200442002114 is 411200244002201.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in only one way, i.e., 70393492746889 + 31806949255225 = 8390083^2 + 5639765^2 .
It is a self number, because there is not a number n which added to its sum of digits gives 102200442002114.
It is not an unprimeable number, because it can be changed into a prime (102200442002117) 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, 25550110500527 + ... + 25550110500530.
Almost surely, 2102200442002114 is an apocalyptic number.
102200442002114 is a deficient number, since it is larger than the sum of its proper divisors (51100221001060).
102200442002114 is an equidigital number, since it uses as much as digits as its factorization.
102200442002114 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 51100221001059.
The product of its (nonzero) digits is 1024, while the sum is 23.
Adding to 102200442002114 its reverse (411200244002201), we get a palindrome (513400686004315).
The spelling of 102200442002114 in words is "one hundred two trillion, two hundred billion, four hundred forty-two million, two thousand, one hundred fourteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •