Base | Representation |
---|---|
bin | 10111001100011101010110… |
… | …000011100011110111011011 |
3 | 111101012011202202120001220122 |
4 | 113030131112003203313123 |
5 | 101332322430234134321 |
6 | 1000543145344143455 |
7 | 30326031634225643 |
oct | 2714352603436733 |
9 | 441164682501818 |
10 | 102011212021211 |
11 | 2a55a791839499 |
12 | b536558607b8b |
13 | 44bc80150a79c |
14 | 1b295247a3523 |
15 | bbd82bc6c8ab |
hex | 5cc7560e3ddb |
102011212021211 has 4 divisors (see below), whose sum is σ = 102013406942832. Its totient is φ = 102009017099592.
The previous prime is 102011212021207. The next prime is 102011212021223. The reversal of 102011212021211 is 112120212110201.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 102011212021211 - 22 = 102011212021207 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 102011212021211.
It is not an unprimeable number, because it can be changed into a prime (102011212021241) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1097391095 + ... + 1097484048.
It is an arithmetic number, because the mean of its divisors is an integer number (25503351735708).
Almost surely, 2102011212021211 is an apocalyptic number.
102011212021211 is a deficient number, since it is larger than the sum of its proper divisors (2194921621).
102011212021211 is an equidigital number, since it uses as much as digits as its factorization.
102011212021211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2194921620.
The product of its (nonzero) digits is 32, while the sum is 17.
Adding to 102011212021211 its reverse (112120212110201), we get a palindrome (214131424131412).
The spelling of 102011212021211 in words is "one hundred two trillion, eleven billion, two hundred twelve million, twenty-one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •