Base | Representation |
---|---|
bin | 111000011001001000… |
… | …0101001101010010111 |
3 | 102120120211100202121012 |
4 | 1300302100221222113 |
5 | 3441004142410124 |
6 | 131344510442435 |
7 | 11515012436204 |
oct | 1606220515227 |
9 | 376524322535 |
10 | 121102310039 |
11 | 473a5107a57 |
12 | 1b578b0341b |
13 | b55c696629 |
14 | 5c0b8c6cab |
15 | 323bb45e0e |
hex | 1c32429a97 |
121102310039 has 4 divisors (see below), whose sum is σ = 124056024960. Its totient is φ = 118148595120.
The previous prime is 121102310023. The next prime is 121102310041. The reversal of 121102310039 is 930013201121.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 930013201121 = 83059 ⋅11197019.
It is a cyclic number.
It is not a de Polignac number, because 121102310039 - 24 = 121102310023 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 121102309996 and 121102310023.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (121102310089) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1476857399 + ... + 1476857480.
It is an arithmetic number, because the mean of its divisors is an integer number (31014006240).
Almost surely, 2121102310039 is an apocalyptic number.
121102310039 is a deficient number, since it is larger than the sum of its proper divisors (2953714921).
121102310039 is an equidigital number, since it uses as much as digits as its factorization.
121102310039 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2953714920.
The product of its (nonzero) digits is 324, while the sum is 23.
The spelling of 121102310039 in words is "one hundred twenty-one billion, one hundred two million, three hundred ten thousand, thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •