Base | Representation |
---|---|
bin | 11011110011111001111000… |
… | …110011000011100010011101 |
3 | 121001002010002022011122212102 |
4 | 123303321320303003202131 |
5 | 112012443241424231440 |
6 | 1112050154012414445 |
7 | 34522621360552520 |
oct | 3363717063034235 |
9 | 531063068148772 |
10 | 122314105305245 |
11 | 35a781367a4957 |
12 | 11875362477425 |
13 | 533322ab7bcb9 |
14 | 222c06a10abb7 |
15 | e21a0d2c6b15 |
hex | 6f3e78cc389d |
122314105305245 has 16 divisors (see below), whose sum is σ = 167763389933568. Its totient is φ = 83863363737600.
The previous prime is 122314105305241. The next prime is 122314105305251. The reversal of 122314105305245 is 542503501413221.
It is not a de Polignac number, because 122314105305245 - 22 = 122314105305241 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 122314105305199 and 122314105305208.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (122314105305241) 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, 190625444 + ... + 191266013.
It is an arithmetic number, because the mean of its divisors is an integer number (10485211870848).
Almost surely, 2122314105305245 is an apocalyptic number.
It is an amenable number.
122314105305245 is a deficient number, since it is larger than the sum of its proper divisors (45449284628323).
122314105305245 is an equidigital number, since it uses as much as digits as its factorization.
122314105305245 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 381900620.
The product of its (nonzero) digits is 144000, while the sum is 38.
Adding to 122314105305245 its reverse (542503501413221), we get a palindrome (664817606718466).
The spelling of 122314105305245 in words is "one hundred twenty-two trillion, three hundred fourteen billion, one hundred five million, three hundred five thousand, two hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •