Base | Representation |
---|---|
bin | 11011110100001000110010… |
… | …111001101101000110011101 |
3 | 121001010122101212120001001011 |
4 | 123310020302321231012131 |
5 | 112013224032300344123 |
6 | 1112101402230415221 |
7 | 34524026140561141 |
oct | 3364106271550635 |
9 | 531118355501034 |
10 | 122330112512413 |
11 | 35a83a00412593 |
12 | 1187848b201511 |
13 | 53348ac289810 |
14 | 222cb47dd7221 |
15 | e22148742e0d |
hex | 6f4232e6d19d |
122330112512413 has 16 divisors (see below), whose sum is σ = 131836791655296. Its totient is φ = 112837264148160.
The previous prime is 122330112512411. The next prime is 122330112512453. The reversal of 122330112512413 is 314215211033221.
It is a cyclic number.
It is not a de Polignac number, because 122330112512413 - 21 = 122330112512411 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (122330112512411) 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, 142681056 + ... + 143535862.
It is an arithmetic number, because the mean of its divisors is an integer number (8239799478456).
Almost surely, 2122330112512413 is an apocalyptic number.
122330112512413 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
122330112512413 is a deficient number, since it is larger than the sum of its proper divisors (9506679142883).
122330112512413 is a wasteful number, since it uses less digits than its factorization.
122330112512413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 862884.
The product of its (nonzero) digits is 8640, while the sum is 31.
Adding to 122330112512413 its reverse (314215211033221), we get a palindrome (436545323545634).
The spelling of 122330112512413 in words is "one hundred twenty-two trillion, three hundred thirty billion, one hundred twelve million, five hundred twelve thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •