Base | Representation |
---|---|
bin | 11011110100001100100000… |
… | …101100011100010110010101 |
3 | 121001011000200220111200110111 |
4 | 123310030200230130112111 |
5 | 112013310220103411313 |
6 | 1112103302143323021 |
7 | 34524230043016150 |
oct | 3364144054342625 |
9 | 531130626450414 |
10 | 122334102013333 |
11 | 35a85668385691 |
12 | 118792032b0471 |
13 | 5335096973452 |
14 | 222d005bb6c97 |
15 | e222cdae243d |
hex | 6f4320b1c595 |
122334102013333 has 16 divisors (see below), whose sum is σ = 141727710792960. Its totient is φ = 103419862874496.
The previous prime is 122334102013309. The next prime is 122334102013379. The reversal of 122334102013333 is 333310201433221.
It is a de Polignac number, because none of the positive numbers 2k-122334102013333 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 122334102013295 and 122334102013304.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (122334102013303) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 33475416 + ... + 36949582.
It is an arithmetic number, because the mean of its divisors is an integer number (8857981924560).
Almost surely, 2122334102013333 is an apocalyptic number.
It is an amenable number.
122334102013333 is a deficient number, since it is larger than the sum of its proper divisors (19393608779627).
122334102013333 is an equidigital number, since it uses as much as digits as its factorization.
122334102013333 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3543156.
The product of its (nonzero) digits is 23328, while the sum is 31.
Adding to 122334102013333 its reverse (333310201433221), we get a palindrome (455644303446554).
The spelling of 122334102013333 in words is "one hundred twenty-two trillion, three hundred thirty-four billion, one hundred two million, thirteen thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •