Base | Representation |
---|---|
bin | 110000010010100101111001… |
… | …010111101000010100011101 |
3 | 1000211222200220100110202221002 |
4 | 300102211321113220110131 |
5 | 210314144133224320001 |
6 | 2031411445500520045 |
7 | 62510141250066446 |
oct | 6022457127502435 |
9 | 1024880810422832 |
10 | 212383874057501 |
11 | 6174354a084243 |
12 | 1b9a1501850025 |
13 | 9167937408b93 |
14 | 3a63611c0c2cd |
15 | 19848d2cd646b |
hex | c129795e851d |
212383874057501 has 2 divisors, whose sum is σ = 212383874057502. Its totient is φ = 212383874057500.
The previous prime is 212383874057449. The next prime is 212383874057567. The reversal of 212383874057501 is 105750478383212.
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., 211242213862276 + 1141660195225 = 14534174^2 + 1068485^2 .
It is a cyclic number.
It is not a de Polignac number, because 212383874057501 - 242 = 207985827546397 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (212383874054501) 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 as a sum of consecutive naturals, namely, 106191937028750 + 106191937028751.
It is an arithmetic number, because the mean of its divisors is an integer number (106191937028751).
Almost surely, 2212383874057501 is an apocalyptic number.
It is an amenable number.
212383874057501 is a deficient number, since it is larger than the sum of its proper divisors (1).
212383874057501 is an equidigital number, since it uses as much as digits as its factorization.
212383874057501 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 11289600, while the sum is 56.
The spelling of 212383874057501 in words is "two hundred twelve trillion, three hundred eighty-three billion, eight hundred seventy-four million, fifty-seven thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •