Base | Representation |
---|---|
bin | 1001101001010110011011… |
… | …01110110100011010000101 |
3 | 2210002211212202111101011121 |
4 | 10310223031232310122011 |
5 | 10240014134012011323 |
6 | 113040354110433541 |
7 | 4316342065000663 |
oct | 464531556643205 |
9 | 83084782441147 |
10 | 21212000110213 |
11 | 6838a60080590 |
12 | 246703bb028b1 |
13 | bab38aa71473 |
14 | 5349483d1c33 |
15 | 26bb8d314a5d |
hex | 134acdbb4685 |
21212000110213 has 8 divisors (see below), whose sum is σ = 23170932277920. Its totient is φ = 19258162696080.
The previous prime is 21212000110199. The next prime is 21212000110247. The reversal of 21212000110213 is 31201100021212.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-21212000110213 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21212000110283) 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 7 ways as a sum of consecutive naturals, for example, 1273679683 + ... + 1273696336.
It is an arithmetic number, because the mean of its divisors is an integer number (2896366534740).
Almost surely, 221212000110213 is an apocalyptic number.
It is an amenable number.
21212000110213 is a deficient number, since it is larger than the sum of its proper divisors (1958932167707).
21212000110213 is a wasteful number, since it uses less digits than its factorization.
21212000110213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2547376787.
The product of its (nonzero) digits is 48, while the sum is 16.
Adding to 21212000110213 its reverse (31201100021212), we get a palindrome (52413100131425).
The spelling of 21212000110213 in words is "twenty-one trillion, two hundred twelve billion, one hundred ten thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •