Base | Representation |
---|---|
bin | 11011110100001000111110… |
… | …001100100101011101001011 |
3 | 121001010122220002010120112011 |
4 | 123310020332030211131023 |
5 | 112013224424303324321 |
6 | 1112101433120200351 |
7 | 34524033631360600 |
oct | 3364107614453513 |
9 | 531118802116464 |
10 | 122330302011211 |
11 | 35a83a98382868 |
12 | 118785227690b7 |
13 | 533490c608098 |
14 | 222cb652446a7 |
15 | e2215a1c5ae1 |
hex | 6f423e32574b |
122330302011211 has 24 divisors (see below), whose sum is σ = 143643538304640. Its totient is φ = 103867537197312.
The previous prime is 122330302011103. The next prime is 122330302011241. The reversal of 122330302011211 is 112110203033221.
It is not a de Polignac number, because 122330302011211 - 211 = 122330302009163 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (122330302011241) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 3459525 + ... + 16019641.
It is an arithmetic number, because the mean of its divisors is an integer number (5985147429360).
Almost surely, 2122330302011211 is an apocalyptic number.
122330302011211 is a deficient number, since it is larger than the sum of its proper divisors (21313236293429).
122330302011211 is a wasteful number, since it uses less digits than its factorization.
122330302011211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12562003 (or 12561996 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 22.
Adding to 122330302011211 its reverse (112110203033221), we get a palindrome (234440505044432).
It can be divided in two parts, 12233030 and 2011211, that added together give a palindrome (14244241).
The spelling of 122330302011211 in words is "one hundred twenty-two trillion, three hundred thirty billion, three hundred two million, eleven thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.100 sec. • engine limits •