Base | Representation |
---|---|
bin | 110000011011000111100001… |
… | …010011101100010000110101 |
3 | 1000221001201002220012101201111 |
4 | 300123013201103230100311 |
5 | 210403244003223022142 |
6 | 2032540540031555021 |
7 | 62600361346311502 |
oct | 6033074123542065 |
9 | 1027051086171644 |
10 | 212969733407797 |
11 | 61949a58443383 |
12 | 1ba76b6498ba71 |
13 | 91aac62580532 |
14 | 3a83b0c0464a9 |
15 | 1994c714dbe17 |
hex | c1b1e14ec435 |
212969733407797 has 2 divisors, whose sum is σ = 212969733407798. Its totient is φ = 212969733407796.
The previous prime is 212969733407671. The next prime is 212969733407839. The reversal of 212969733407797 is 797704337969212.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 204173206188561 + 8796527219236 = 14288919^2 + 2965894^2 .
It is a cyclic number.
It is not a de Polignac number, because 212969733407797 - 215 = 212969733375029 is a prime.
It is a super-2 number, since 2×2129697334077972 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (212969733407297) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 106484866703898 + 106484866703899.
It is an arithmetic number, because the mean of its divisors is an integer number (106484866703899).
Almost surely, 2212969733407797 is an apocalyptic number.
It is an amenable number.
212969733407797 is a deficient number, since it is larger than the sum of its proper divisors (1).
212969733407797 is an equidigital number, since it uses as much as digits as its factorization.
212969733407797 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1512284256, while the sum is 76.
The spelling of 212969733407797 in words is "two hundred twelve trillion, nine hundred sixty-nine billion, seven hundred thirty-three million, four hundred seven thousand, seven hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •