Base | Representation |
---|---|
bin | 11011100101010010110110… |
… | …101110101111000101010011 |
3 | 120220112010121222111000200101 |
4 | 123211102312232233011103 |
5 | 111400021112213404021 |
6 | 1110001033430233231 |
7 | 34360236624434551 |
oct | 3345226656570523 |
9 | 526463558430611 |
10 | 121310122013011 |
11 | 35720374367608 |
12 | 1173286a4b5817 |
13 | 528c659591809 |
14 | 21d5626a5cbd1 |
15 | e0584bedaa91 |
hex | 6e54b6baf153 |
121310122013011 has 2 divisors, whose sum is σ = 121310122013012. Its totient is φ = 121310122013010.
The previous prime is 121310122012993. The next prime is 121310122013081. The reversal of 121310122013011 is 110310221013121.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-121310122013011 is a prime.
It is a super-2 number, since 2×1213101220130112 (a number of 29 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 121310122013011.
It is not a weakly prime, because it can be changed into another prime (121310122013081) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 60655061006505 + 60655061006506.
It is an arithmetic number, because the mean of its divisors is an integer number (60655061006506).
Almost surely, 2121310122013011 is an apocalyptic number.
121310122013011 is a deficient number, since it is larger than the sum of its proper divisors (1).
121310122013011 is an equidigital number, since it uses as much as digits as its factorization.
121310122013011 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 72, while the sum is 19.
Adding to 121310122013011 its reverse (110310221013121), we get a palindrome (231620343026132).
The spelling of 121310122013011 in words is "one hundred twenty-one trillion, three hundred ten billion, one hundred twenty-two million, thirteen thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •