Base | Representation |
---|---|
bin | 1000011110011010101… |
… | …1010111010111011011 |
3 | 111220211101201000212101 |
4 | 2013212223113113123 |
5 | 4341144114021342 |
6 | 150520052024231 |
7 | 13343126663452 |
oct | 2074653272733 |
9 | 456741630771 |
10 | 145604048347 |
11 | 5682876465a |
12 | 24276602077 |
13 | 10965906034 |
14 | 7093a0bb99 |
15 | 3bc2be53b7 |
hex | 21e6ad75db |
145604048347 has 2 divisors, whose sum is σ = 145604048348. Its totient is φ = 145604048346.
The previous prime is 145604048329. The next prime is 145604048363. The reversal of 145604048347 is 743840406541.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 145604048347 - 211 = 145604046299 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 145604048297 and 145604048306.
It is not a weakly prime, because it can be changed into another prime (145604042347) 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, 72802024173 + 72802024174.
It is an arithmetic number, because the mean of its divisors is an integer number (72802024174).
Almost surely, 2145604048347 is an apocalyptic number.
145604048347 is a deficient number, since it is larger than the sum of its proper divisors (1).
145604048347 is an equidigital number, since it uses as much as digits as its factorization.
145604048347 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1290240, while the sum is 46.
The spelling of 145604048347 in words is "one hundred forty-five billion, six hundred four million, forty-eight thousand, three hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •