Base | Representation |
---|---|
bin | 11011110000111100000000… |
… | …011010000010111001101010 |
3 | 121000100121211022210122202001 |
4 | 123300330000122002321222 |
5 | 112001123213314121302 |
6 | 1111412354522201214 |
7 | 34502113064332003 |
oct | 3360740032027152 |
9 | 530317738718661 |
10 | 122110222020202 |
11 | 359a9721a18179 |
12 | 1184194235320a |
13 | 5319c38185030 |
14 | 22222483b81aa |
15 | e1b578e84787 |
hex | 6f0f00682e6a |
122110222020202 has 16 divisors (see below), whose sum is σ = 197443015043400. Its totient is φ = 56304838006272.
The previous prime is 122110222020181. The next prime is 122110222020271. The reversal of 122110222020202 is 202020222011221.
122110222020202 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 4 ways, for example, as 120640984701561 + 1469237318641 = 10983669^2 + 1212121^2 .
It is a super-2 number, since 2×1221102220202022 (a number of 29 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 122110222020202.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2238555663 + ... + 2238610210.
Almost surely, 2122110222020202 is an apocalyptic number.
122110222020202 is a deficient number, since it is larger than the sum of its proper divisors (75332793023198).
122110222020202 is a wasteful number, since it uses less digits than its factorization.
122110222020202 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4477166937.
The product of its (nonzero) digits is 256, while the sum is 19.
Adding to 122110222020202 its reverse (202020222011221), we get a palindrome (324130444031423).
The spelling of 122110222020202 in words is "one hundred twenty-two trillion, one hundred ten billion, two hundred twenty-two million, twenty thousand, two hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.108 sec. • engine limits •