Base | Representation |
---|---|
bin | 111000110111110110… |
… | …0110100001011100011 |
3 | 102200020122222111011112 |
4 | 1301233230310023203 |
5 | 4000112033301311 |
6 | 132035052133535 |
7 | 11552400151361 |
oct | 1615754641343 |
9 | 380218874145 |
10 | 122133103331 |
11 | 47883a53238 |
12 | 1b8061672ab |
13 | b6950c58a5 |
14 | 5ca876c631 |
15 | 329c3ab28b |
hex | 1c6fb342e3 |
122133103331 has 8 divisors (see below), whose sum is σ = 122619600144. Its totient is φ = 121646694400.
The previous prime is 122133103289. The next prime is 122133103343. The reversal of 122133103331 is 133301331221.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 122133103331 - 210 = 122133102307 is a prime.
It is a super-2 number, since 2×1221331033312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 122133103297 and 122133103306.
It is not an unprimeable number, because it can be changed into a prime (122133103361) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5252531 + ... + 5275731.
It is an arithmetic number, because the mean of its divisors is an integer number (15327450018).
Almost surely, 2122133103331 is an apocalyptic number.
122133103331 is a deficient number, since it is larger than the sum of its proper divisors (486496813).
122133103331 is a wasteful number, since it uses less digits than its factorization.
122133103331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 43941.
The product of its (nonzero) digits is 972, while the sum is 23.
Adding to 122133103331 its reverse (133301331221), we get a palindrome (255434434552).
The spelling of 122133103331 in words is "one hundred twenty-two billion, one hundred thirty-three million, one hundred three thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •