Base | Representation |
---|---|
bin | 110000010001011000111010… |
… | …110111001111100001001101 |
3 | 1000211200210120010011111000002 |
4 | 300101120322313033201031 |
5 | 210311320400034020133 |
6 | 2031305500131014045 |
7 | 62501154111520214 |
oct | 6021307267174115 |
9 | 1024623503144002 |
10 | 212301221001293 |
11 | 61711495634826 |
12 | 1b98949543a325 |
13 | 915cbc4745928 |
14 | 3a5d61098007b |
15 | 1982696956ce8 |
hex | c1163adcf84d |
212301221001293 has 2 divisors, whose sum is σ = 212301221001294. Its totient is φ = 212301221001292.
The previous prime is 212301221001277. The next prime is 212301221001299. The reversal of 212301221001293 is 392100122103212.
212301221001293 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 138422331151204 + 73878889850089 = 11765302^2 + 8595283^2 .
It is a cyclic number.
It is not a de Polignac number, because 212301221001293 - 24 = 212301221001277 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (212301221001299) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 106150610500646 + 106150610500647.
It is an arithmetic number, because the mean of its divisors is an integer number (106150610500647).
Almost surely, 2212301221001293 is an apocalyptic number.
It is an amenable number.
212301221001293 is a deficient number, since it is larger than the sum of its proper divisors (1).
212301221001293 is an equidigital number, since it uses as much as digits as its factorization.
212301221001293 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2592, while the sum is 29.
The spelling of 212301221001293 in words is "two hundred twelve trillion, three hundred one billion, two hundred twenty-one million, one thousand, two hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •