Base | Representation |
---|---|
bin | 10111001110000011100111… |
… | …001011111111111100100110 |
3 | 111101120200012112201212012222 |
4 | 113032003213023333330212 |
5 | 101341122322401041402 |
6 | 1001105425514112342 |
7 | 30340000050134036 |
oct | 2716034713777446 |
9 | 441520175655188 |
10 | 102121021112102 |
11 | 2a5a2311145783 |
12 | b5538a341b6b2 |
13 | 44c9c812b4205 |
14 | 1b3098048d8c6 |
15 | bc16072047a2 |
hex | 5ce0e72fff26 |
102121021112102 has 4 divisors (see below), whose sum is σ = 153181531668156. Its totient is φ = 51060510556050.
The previous prime is 102121021112101. The next prime is 102121021112129. The reversal of 102121021112102 is 201211120121201.
It is a semiprime because it is the product of two primes.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102121021112101) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 25530255278024 + ... + 25530255278027.
It is an arithmetic number, because the mean of its divisors is an integer number (38295382917039).
Almost surely, 2102121021112102 is an apocalyptic number.
102121021112102 is a deficient number, since it is larger than the sum of its proper divisors (51060510556054).
102121021112102 is an equidigital number, since it uses as much as digits as its factorization.
102121021112102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 51060510556053.
The product of its (nonzero) digits is 32, while the sum is 17.
Adding to 102121021112102 its reverse (201211120121201), we get a palindrome (303332141233303).
Subtracting 102121021112102 from its reverse (201211120121201), we obtain a palindrome (99090099009099).
The spelling of 102121021112102 in words is "one hundred two trillion, one hundred twenty-one billion, twenty-one million, one hundred twelve thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •