Base | Representation |
---|---|
bin | 11011111000010000011100… |
… | …010100000111010100101101 |
3 | 121002010201002211020121021110 |
4 | 123320100130110013110231 |
5 | 112032343314024314013 |
6 | 1112435421020022233 |
7 | 34553340301456212 |
oct | 3370203424072455 |
9 | 532121084217243 |
10 | 122613201401133 |
11 | 36082a6a742663 |
12 | 11903315091979 |
13 | 53554b56481b1 |
14 | 223c721197b09 |
15 | e296b64372c3 |
hex | 6f841c50752d |
122613201401133 has 16 divisors (see below), whose sum is σ = 171343788074496. Its totient is φ = 77843687325360.
The previous prime is 122613201401107. The next prime is 122613201401219. The reversal of 122613201401133 is 331104102316221.
It is not a de Polignac number, because 122613201401133 - 25 = 122613201401101 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 122613201401133.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (122613201401833) 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, 3914087683 + ... + 3914119008.
It is an arithmetic number, because the mean of its divisors is an integer number (10708986754656).
Almost surely, 2122613201401133 is an apocalyptic number.
It is an amenable number.
122613201401133 is a deficient number, since it is larger than the sum of its proper divisors (48730586673363).
122613201401133 is a wasteful number, since it uses less digits than its factorization.
122613201401133 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7828206944.
The product of its (nonzero) digits is 5184, while the sum is 30.
Adding to 122613201401133 its reverse (331104102316221), we get a palindrome (453717303717354).
The spelling of 122613201401133 in words is "one hundred twenty-two trillion, six hundred thirteen billion, two hundred one million, four hundred one thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •