Base | Representation |
---|---|
bin | 101111101101000000… |
… | …1101011001110111001 |
3 | 100210102100220220021002 |
4 | 1133122001223032321 |
5 | 3134300140320441 |
6 | 115021122054345 |
7 | 10254416440145 |
oct | 1373201531671 |
9 | 323370826232 |
10 | 102442120121 |
11 | 3a4999a70a0 |
12 | 17a2b7aa3b5 |
13 | 9877754c33 |
14 | 4d5b526225 |
15 | 29e8830b9b |
hex | 17da06b3b9 |
102442120121 has 8 divisors (see below), whose sum is σ = 111757572288. Its totient is φ = 93127090000.
The previous prime is 102442120111. The next prime is 102442120133. The reversal of 102442120121 is 121021244201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 102442120121 - 26 = 102442120057 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 102442120093 and 102442120102.
It is not an unprimeable number, because it can be changed into a prime (102442120111) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 617396 + ... + 765546.
It is an arithmetic number, because the mean of its divisors is an integer number (13969696536).
Almost surely, 2102442120121 is an apocalyptic number.
102442120121 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
102442120121 is a deficient number, since it is larger than the sum of its proper divisors (9315452167).
102442120121 is a wasteful number, since it uses less digits than its factorization.
102442120121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 211023.
The product of its (nonzero) digits is 256, while the sum is 20.
Adding to 102442120121 its reverse (121021244201), we get a palindrome (223463364322).
The spelling of 102442120121 in words is "one hundred two billion, four hundred forty-two million, one hundred twenty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •