Base | Representation |
---|---|
bin | 11011110010100010010000… |
… | …010110100100100101100110 |
3 | 121000202010012201112102101222 |
4 | 123302202100112210211212 |
5 | 112004423040332223420 |
6 | 1111535033101420342 |
7 | 34513050546135461 |
oct | 3362422026444546 |
9 | 530663181472358 |
10 | 122220011211110 |
11 | 35a4124107229a |
12 | 1185b08256a6b2 |
13 | 53273b3ab1a17 |
14 | 22276a15a42d8 |
15 | e1e3527da225 |
hex | 6f28905a4966 |
122220011211110 has 32 divisors (see below), whose sum is σ = 227093499666432. Its totient is φ = 47310798399840.
The previous prime is 122220011211041. The next prime is 122220011211131. The reversal of 122220011211110 is 11112110022221.
122220011211110 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×1222200112111102 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 112263239 + ... + 113346701.
It is an arithmetic number, because the mean of its divisors is an integer number (7096671864576).
Almost surely, 2122220011211110 is an apocalyptic number.
122220011211110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
122220011211110 is a deficient number, since it is larger than the sum of its proper divisors (104873488455322).
122220011211110 is a wasteful number, since it uses less digits than its factorization.
122220011211110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1447388.
The product of its (nonzero) digits is 32, while the sum is 17.
Adding to 122220011211110 its reverse (11112110022221), we get a palindrome (133332121233331).
The spelling of 122220011211110 in words is "one hundred twenty-two trillion, two hundred twenty billion, eleven million, two hundred eleven thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •