Base | Representation |
---|---|
bin | 101101001000001000100… |
… | …100010011101001110001 |
3 | 101222110111200210201022222 |
4 | 231020020210103221301 |
5 | 401302033142414441 |
6 | 10332344052210425 |
7 | 440022254060123 |
oct | 55101044235161 |
9 | 11873450721288 |
10 | 3101110123121 |
11 | a9619a9007aa |
12 | 421023609a15 |
13 | 196583325c1a |
14 | aa14756d213 |
15 | 55a01163d4b |
hex | 2d208913a71 |
3101110123121 has 16 divisors (see below), whose sum is σ = 3187908337536. Its totient is φ = 3015365074176.
The previous prime is 3101110123079. The next prime is 3101110123127. The reversal of 3101110123121 is 1213210111013.
It is a cyclic number.
It is not a de Polignac number, because 3101110123121 - 230 = 3100036381297 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 3101110123121.
It is not an unprimeable number, because it can be changed into a prime (3101110123127) 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 15 ways as a sum of consecutive naturals, for example, 77735246 + ... + 77775128.
It is an arithmetic number, because the mean of its divisors is an integer number (199244271096).
Almost surely, 23101110123121 is an apocalyptic number.
It is an amenable number.
3101110123121 is a deficient number, since it is larger than the sum of its proper divisors (86798214415).
3101110123121 is a wasteful number, since it uses less digits than its factorization.
3101110123121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 53032.
The product of its (nonzero) digits is 36, while the sum is 17.
Adding to 3101110123121 its reverse (1213210111013), we get a palindrome (4314320234134).
The spelling of 3101110123121 in words is "three trillion, one hundred one billion, one hundred ten million, one hundred twenty-three thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •