Base | Representation |
---|---|
bin | 11011100010011000100100… |
… | …110110001111111110111101 |
3 | 120212211000100112002111011021 |
4 | 123202120210312033332331 |
5 | 111333231444114414004 |
6 | 1105325114205224141 |
7 | 34336626220463245 |
oct | 3342304466177675 |
9 | 525730315074137 |
10 | 121110106013629 |
11 | 35653564568887 |
12 | 116bbb49562051 |
13 | 5276831b60165 |
14 | 21c9a907b4b25 |
15 | e00542455d54 |
hex | 6e2624d8ffbd |
121110106013629 has 2 divisors, whose sum is σ = 121110106013630. Its totient is φ = 121110106013628.
The previous prime is 121110106013621. The next prime is 121110106013647. The reversal of 121110106013629 is 926310601011121.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 100691230388004 + 20418875625625 = 10034502^2 + 4518725^2 .
It is a cyclic number.
It is not a de Polignac number, because 121110106013629 - 23 = 121110106013621 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 121110106013594 and 121110106013603.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (121110106013621) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 60555053006814 + 60555053006815.
It is an arithmetic number, because the mean of its divisors is an integer number (60555053006815).
Almost surely, 2121110106013629 is an apocalyptic number.
It is an amenable number.
121110106013629 is a deficient number, since it is larger than the sum of its proper divisors (1).
121110106013629 is an equidigital number, since it uses as much as digits as its factorization.
121110106013629 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 3888, while the sum is 34.
The spelling of 121110106013629 in words is "one hundred twenty-one trillion, one hundred ten billion, one hundred six million, thirteen thousand, six hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •