Base | Representation |
---|---|
bin | 11011110010100100010011… |
… | …011010010111101101000011 |
3 | 121000202022212221222121012011 |
4 | 123302210103122113231003 |
5 | 112004442041231202321 |
6 | 1111540035205513351 |
7 | 34513156205543455 |
oct | 3362442332275503 |
9 | 530668787877164 |
10 | 122222210022211 |
11 | 35a4216a25a652 |
12 | 1185b596a12857 |
13 | 53276744b8190 |
14 | 222782d6122d5 |
15 | e1e43086eae1 |
hex | 6f2913697b43 |
122222210022211 has 8 divisors (see below), whose sum is σ = 132003238140144. Its totient is φ = 112495370426400.
The previous prime is 122222210022181. The next prime is 122222210022229. The reversal of 122222210022211 is 112220012222221.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 122222210022211 - 223 = 122222201633603 is a prime.
It is a super-2 number, since 2×1222222100222112 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (122222210026211) 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, 13547125840 + ... + 13547134861.
It is an arithmetic number, because the mean of its divisors is an integer number (16500404767518).
Almost surely, 2122222210022211 is an apocalyptic number.
122222210022211 is a deficient number, since it is larger than the sum of its proper divisors (9781028117933).
122222210022211 is a wasteful number, since it uses less digits than its factorization.
122222210022211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27094261061.
The product of its (nonzero) digits is 512, while the sum is 22.
Adding to 122222210022211 its reverse (112220012222221), we get a palindrome (234442222244432).
The spelling of 122222210022211 in words is "one hundred twenty-two trillion, two hundred twenty-two billion, two hundred ten million, twenty-two thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •