Base | Representation |
---|---|
bin | 1011000110110001100011… |
… | …1111000101001101001110 |
3 | 1121020100202100220022122121 |
4 | 2301230120333011031032 |
5 | 3100031122332241420 |
6 | 41545354444403154 |
7 | 2400134145510514 |
oct | 261543077051516 |
9 | 47210670808577 |
10 | 12211011212110 |
11 | 398872a5416a7 |
12 | 14526aab464ba |
13 | 6a7655060889 |
14 | 30303224c4b4 |
15 | 162982deb2aa |
hex | b1b18fc534e |
12211011212110 has 64 divisors (see below), whose sum is σ = 22513993887744. Its totient is φ = 4767102256000.
The previous prime is 12211011212069. The next prime is 12211011212117. The reversal of 12211011212110 is 1121211011221.
It is a super-2 number, since 2×122110112121102 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12211011212117) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 560976447 + ... + 560998213.
It is an arithmetic number, because the mean of its divisors is an integer number (351781154496).
Almost surely, 212211011212110 is an apocalyptic number.
12211011212110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
12211011212110 is a deficient number, since it is larger than the sum of its proper divisors (10302982675634).
12211011212110 is a wasteful number, since it uses less digits than its factorization.
12211011212110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 29769.
The product of its (nonzero) digits is 16, while the sum is 16.
Adding to 12211011212110 its reverse (1121211011221), we get a palindrome (13332222223331).
The spelling of 12211011212110 in words is "twelve trillion, two hundred eleven billion, eleven million, two hundred twelve thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •