Base | Representation |
---|---|
bin | 10111001110000010110000… |
… | …010011000010110111110011 |
3 | 111101120120211100220022001121 |
4 | 113032002300103002313303 |
5 | 101341113431123242321 |
6 | 1001105154300043111 |
7 | 30336635165460514 |
oct | 2716026023026763 |
9 | 441516740808047 |
10 | 102120100212211 |
11 | 2a5a1989338a94 |
12 | b553686b33497 |
13 | 44c9b65580933 |
14 | 1b308d4052a0b |
15 | bc15a144a441 |
hex | 5ce0b04c2df3 |
102120100212211 has 4 divisors (see below), whose sum is σ = 103131190313424. Its totient is φ = 101109010111000.
The previous prime is 102120100212191. The next prime is 102120100212259. The reversal of 102120100212211 is 112212001021201.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-102120100212211 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (102120100218211) 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 in 3 ways as a sum of consecutive naturals, for example, 505545050455 + ... + 505545050656.
It is an arithmetic number, because the mean of its divisors is an integer number (25782797578356).
Almost surely, 2102120100212211 is an apocalyptic number.
102120100212211 is a deficient number, since it is larger than the sum of its proper divisors (1011090101213).
102120100212211 is a wasteful number, since it uses less digits than its factorization.
102120100212211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1011090101212.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 102120100212211 its reverse (112212001021201), we get a palindrome (214332101233412).
The spelling of 102120100212211 in words is "one hundred two trillion, one hundred twenty billion, one hundred million, two hundred twelve thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •