Base | Representation |
---|---|
bin | 110000010000001111010000… |
… | …001001011101000101011011 |
3 | 1000211102020101111221100020110 |
4 | 300100033100021131011123 |
5 | 210304021401011431021 |
6 | 2031205255131455403 |
7 | 62462354000361414 |
oct | 6020172011350533 |
9 | 1024366344840213 |
10 | 212222121202011 |
11 | 61690994887888 |
12 | 1b97609abb7563 |
13 | 91555c9c7797b |
14 | 3a598695b480b |
15 | 19805b7504476 |
hex | c103d025d15b |
212222121202011 has 8 divisors (see below), whose sum is σ = 282962948445184. Its totient is φ = 141481354046760.
The previous prime is 212222121201947. The next prime is 212222121202043. The reversal of 212222121202011 is 110202121222212.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 212222121202011 - 26 = 212222121201947 is a prime.
It is a super-2 number, since 2×2122221212020112 (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 (212222121202711) 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, 6008335 + ... + 21460296.
It is an arithmetic number, because the mean of its divisors is an integer number (35370368555648).
Almost surely, 2212222121202011 is an apocalyptic number.
212222121202011 is a deficient number, since it is larger than the sum of its proper divisors (70740827243173).
212222121202011 is a wasteful number, since it uses less digits than its factorization.
212222121202011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 30043961.
The product of its (nonzero) digits is 256, while the sum is 21.
Adding to 212222121202011 its reverse (110202121222212), we get a palindrome (322424242424223).
The spelling of 212222121202011 in words is "two hundred twelve trillion, two hundred twenty-two billion, one hundred twenty-one million, two hundred two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •