Base | Representation |
---|---|
bin | 11011101111011000011011… |
… | …011011111010101001011001 |
3 | 120222222101211211121222010120 |
4 | 123233120123123322221121 |
5 | 111442400230114004423 |
6 | 1111251313132303453 |
7 | 34461306353323623 |
oct | 3357303333725131 |
9 | 528871754558116 |
10 | 122003301313113 |
11 | 35968344a76440 |
12 | 11825082911b89 |
13 | 530cb28912c4c |
14 | 221adc415bc13 |
15 | e188bc394ee3 |
hex | 6ef61b6faa59 |
122003301313113 has 8 divisors (see below), whose sum is σ = 177459347364576. Its totient is φ = 73941394735200.
The previous prime is 122003301313099. The next prime is 122003301313121. The reversal of 122003301313113 is 311313103300221.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 122003301313113 - 28 = 122003301312857 is a prime.
It is not an unprimeable number, because it can be changed into a prime (122003301313183) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1848534868348 + ... + 1848534868413.
It is an arithmetic number, because the mean of its divisors is an integer number (22182418420572).
Almost surely, 2122003301313113 is an apocalyptic number.
It is an amenable number.
122003301313113 is a deficient number, since it is larger than the sum of its proper divisors (55456046051463).
122003301313113 is a wasteful number, since it uses less digits than its factorization.
122003301313113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3697069736775.
The product of its (nonzero) digits is 972, while the sum is 24.
Adding to 122003301313113 its reverse (311313103300221), we get a palindrome (433316404613334).
The spelling of 122003301313113 in words is "one hundred twenty-two trillion, three billion, three hundred one million, three hundred thirteen thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •