Base | Representation |
---|---|
bin | 110000011110110000110100… |
… | …001000001011011101100101 |
3 | 1000221221122200111121122201002 |
4 | 300132300310020023131211 |
5 | 210421400013114030312 |
6 | 2033252004420443045 |
7 | 62624440043605214 |
oct | 6036606410133545 |
9 | 1027848614548632 |
10 | 213220231001957 |
11 | 61a36212840473 |
12 | 1bab7613b49485 |
13 | 91c877376142a |
14 | 3a91cb298507b |
15 | 199b532d464c2 |
hex | c1ec3420b765 |
213220231001957 has 2 divisors, whose sum is σ = 213220231001958. Its totient is φ = 213220231001956.
The previous prime is 213220231001951. The next prime is 213220231002013. The reversal of 213220231001957 is 759100132022312.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 130091041816516 + 83129189185441 = 11405746^2 + 9117521^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-213220231001957 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 213220231001957.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (213220231001951) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 106610115500978 + 106610115500979.
It is an arithmetic number, because the mean of its divisors is an integer number (106610115500979).
Almost surely, 2213220231001957 is an apocalyptic number.
It is an amenable number.
213220231001957 is a deficient number, since it is larger than the sum of its proper divisors (1).
213220231001957 is an equidigital number, since it uses as much as digits as its factorization.
213220231001957 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 45360, while the sum is 38.
The spelling of 213220231001957 in words is "two hundred thirteen trillion, two hundred twenty billion, two hundred thirty-one million, one thousand, nine hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •