Base | Representation |
---|---|
bin | 100001000000111100011100… |
… | …001100111100010100010111 |
3 | 201001010000200210112012002202 |
4 | 201000330130030330110113 |
5 | 123012430441211440321 |
6 | 1232452054032155115 |
7 | 42404246035325555 |
oct | 4100743414742427 |
9 | 631100623465082 |
10 | 145200432530711 |
11 | 422a11808836a8 |
12 | 14350997098a9b |
13 | 630345a5b525c |
14 | 27bda4a386bd5 |
15 | 11bbee311e70b |
hex | 840f1c33c517 |
145200432530711 has 2 divisors, whose sum is σ = 145200432530712. Its totient is φ = 145200432530710.
The previous prime is 145200432530677. The next prime is 145200432530767. The reversal of 145200432530711 is 117035234002541.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 145200432530711 - 222 = 145200428336407 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (145200432530771) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 72600216265355 + 72600216265356.
It is an arithmetic number, because the mean of its divisors is an integer number (72600216265356).
Almost surely, 2145200432530711 is an apocalyptic number.
145200432530711 is a deficient number, since it is larger than the sum of its proper divisors (1).
145200432530711 is an equidigital number, since it uses as much as digits as its factorization.
145200432530711 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 100800, while the sum is 38.
The spelling of 145200432530711 in words is "one hundred forty-five trillion, two hundred billion, four hundred thirty-two million, five hundred thirty thousand, seven hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •