Base | Representation |
---|---|
bin | 11011110010100100000111… |
… | …100011010001101000010001 |
3 | 121000202022101002112202020111 |
4 | 123302210013203101220101 |
5 | 112004441134310430113 |
6 | 1111540003340441321 |
7 | 34513151241254365 |
oct | 3362440743215021 |
9 | 530668332482214 |
10 | 122222011030033 |
11 | 35a420779a5902 |
12 | 1185b540249241 |
13 | 53276421c4825 |
14 | 22278110132a5 |
15 | e1e41d16413d |
hex | 6f29078d1a11 |
122222011030033 has 8 divisors (see below), whose sum is σ = 123410058303168. Its totient is φ = 121033991176464.
The previous prime is 122222011030003. The next prime is 122222011030037. The reversal of 122222011030033 is 330030110222221.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-122222011030033 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 122222011029986 and 122222011030013.
It is not an unprimeable number, because it can be changed into a prime (122222011030037) 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, 2160735 + ... + 15783307.
It is an arithmetic number, because the mean of its divisors is an integer number (15426257287896).
Almost surely, 2122222011030033 is an apocalyptic number.
It is an amenable number.
122222011030033 is a deficient number, since it is larger than the sum of its proper divisors (1188047273135).
122222011030033 is a wasteful number, since it uses less digits than its factorization.
122222011030033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13709783.
The product of its (nonzero) digits is 864, while the sum is 22.
Adding to 122222011030033 its reverse (330030110222221), we get a palindrome (452252121252254).
The spelling of 122222011030033 in words is "one hundred twenty-two trillion, two hundred twenty-two billion, eleven million, thirty thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •