Base | Representation |
---|---|
bin | 100001000110000100111011… |
… | …100111001010000110001101 |
3 | 201002100202010001200022100022 |
4 | 201012010323213022012031 |
5 | 123034220321041033421 |
6 | 1233322105331311525 |
7 | 42441603444301652 |
oct | 4106047347120615 |
9 | 632322101608308 |
10 | 145553146814861 |
11 | 424178198a5895 |
12 | 143a921244b5a5 |
13 | 632a7ab5cbb76 |
14 | 27d2b4a4c9c29 |
15 | 11c62885ca7ab |
hex | 84613b9ca18d |
145553146814861 has 2 divisors, whose sum is σ = 145553146814862. Its totient is φ = 145553146814860.
The previous prime is 145553146814807. The next prime is 145553146814891. The reversal of 145553146814861 is 168418641355541.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 95786739184900 + 49766407629961 = 9787070^2 + 7054531^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-145553146814861 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 145553146814794 and 145553146814803.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (145553146814891) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 72776573407430 + 72776573407431.
It is an arithmetic number, because the mean of its divisors is an integer number (72776573407431).
Almost surely, 2145553146814861 is an apocalyptic number.
It is an amenable number.
145553146814861 is a deficient number, since it is larger than the sum of its proper divisors (1).
145553146814861 is an equidigital number, since it uses as much as digits as its factorization.
145553146814861 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 55296000, while the sum is 62.
The spelling of 145553146814861 in words is "one hundred forty-five trillion, five hundred fifty-three billion, one hundred forty-six million, eight hundred fourteen thousand, eight hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.105 sec. • engine limits •