Base | Representation |
---|---|
bin | 110100110011000001111100… |
… | …011110000010111100001101 |
3 | 1010110011121012122102221102022 |
4 | 310303001330132002330031 |
5 | 220413422222214021333 |
6 | 2141505332444535525 |
7 | 66624162216652163 |
oct | 6463017436027415 |
9 | 1113147178387368 |
10 | 232205200142093 |
11 | 67a957439a3082 |
12 | 22062b0b8515a5 |
13 | 9c74b197170c9 |
14 | 414ab12421233 |
15 | 1bca2cbaa7c98 |
hex | d3307c782f0d |
232205200142093 has 2 divisors, whose sum is σ = 232205200142094. Its totient is φ = 232205200142092.
The previous prime is 232205200142029. The next prime is 232205200142117. The reversal of 232205200142093 is 390241002502232.
232205200142093 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., 211228232218249 + 20976967923844 = 14533693^2 + 4580062^2 .
It is a cyclic number.
It is not a de Polignac number, because 232205200142093 - 26 = 232205200142029 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (232205200102093) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 116102600071046 + 116102600071047.
It is an arithmetic number, because the mean of its divisors is an integer number (116102600071047).
Almost surely, 2232205200142093 is an apocalyptic number.
It is an amenable number.
232205200142093 is a deficient number, since it is larger than the sum of its proper divisors (1).
232205200142093 is an equidigital number, since it uses as much as digits as its factorization.
232205200142093 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 51840, while the sum is 35.
The spelling of 232205200142093 in words is "two hundred thirty-two trillion, two hundred five billion, two hundred million, one hundred forty-two thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •