Base | Representation |
---|---|
bin | 1011000110110101101100… |
… | …1100011100001001100110 |
3 | 1121020110121210001201012010 |
4 | 2301231123030130021212 |
5 | 3100040411213311324 |
6 | 41550101004535050 |
7 | 2400203524236120 |
oct | 261553314341146 |
9 | 47213553051163 |
10 | 12212122010214 |
11 | 398914a561765 |
12 | 145295ab51486 |
13 | 6a77a1222469 |
14 | 3030d999c210 |
15 | 1629ea6b6829 |
hex | b1b5b31c266 |
12212122010214 has 64 divisors (see below), whose sum is σ = 27998313578496. Its totient is φ = 3478574065824.
The previous prime is 12212122010189. The next prime is 12212122010227. The reversal of 12212122010214 is 41201022121221.
12212122010214 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 37592109 + ... + 37915575.
It is an arithmetic number, because the mean of its divisors is an integer number (437473649664).
Almost surely, 212212122010214 is an apocalyptic number.
12212122010214 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
12212122010214 is an abundant number, since it is smaller than the sum of its proper divisors (15786191568282).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12212122010214 is a wasteful number, since it uses less digits than its factorization.
12212122010214 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 326209.
The product of its (nonzero) digits is 256, while the sum is 21.
Adding to 12212122010214 its reverse (41201022121221), we get a palindrome (53413144131435).
The spelling of 12212122010214 in words is "twelve trillion, two hundred twelve billion, one hundred twenty-two million, ten thousand, two hundred fourteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •