Base | Representation |
---|---|
bin | 10111001101110001000101… |
… | …000011000110101001110110 |
3 | 111101111202211200011112021212 |
4 | 113031301011003012221312 |
5 | 101340311043434031402 |
6 | 1001052335113441422 |
7 | 30335363650033445 |
oct | 2715610503065166 |
9 | 441452750145255 |
10 | 102101121002102 |
11 | 2a59492a042582 |
12 | b54ba6aa10272 |
13 | 44c812c511cb1 |
14 | 1b2da1356ad5c |
15 | bc0d4011a952 |
hex | 5cdc450c6a76 |
102101121002102 has 4 divisors (see below), whose sum is σ = 153151681503156. Its totient is φ = 51050560501050.
The previous prime is 102101121002087. The next prime is 102101121002147. The reversal of 102101121002102 is 201200121101201.
It is a semiprime because it is the product of two primes.
It is a super-2 number, since 2×1021011210021022 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
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, 25525280250524 + ... + 25525280250527.
It is an arithmetic number, because the mean of its divisors is an integer number (38287920375789).
Almost surely, 2102101121002102 is an apocalyptic number.
102101121002102 is a deficient number, since it is larger than the sum of its proper divisors (51050560501054).
102101121002102 is an equidigital number, since it uses as much as digits as its factorization.
102101121002102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 51050560501053.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 102101121002102 its reverse (201200121101201), we get a palindrome (303301242103303).
Subtracting 102101121002102 from its reverse (201200121101201), we obtain a palindrome (99099000099099).
The spelling of 102101121002102 in words is "one hundred two trillion, one hundred one billion, one hundred twenty-one million, two thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •