Base | Representation |
---|---|
bin | 1000011101111011000… |
… | …0111111100100001101 |
3 | 111220111010221000121001 |
4 | 2013132300333210031 |
5 | 4340411123242442 |
6 | 150454550540301 |
7 | 13336625461513 |
oct | 2073660774415 |
9 | 456433830531 |
10 | 145471305997 |
11 | 5676a83a336 |
12 | 2423a067691 |
13 | 1094426a274 |
14 | 70801364b3 |
15 | 3bb62242b7 |
hex | 21dec3f90d |
145471305997 has 2 divisors, whose sum is σ = 145471305998. Its totient is φ = 145471305996.
The previous prime is 145471305979. The next prime is 145471306021. The reversal of 145471305997 is 799503174541.
Together with previous prime (145471305979) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 105810981796 + 39660324201 = 325286^2 + 199149^2 .
It is a cyclic number.
It is not a de Polignac number, because 145471305997 - 27 = 145471305869 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (145471305697) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 72735652998 + 72735652999.
It is an arithmetic number, because the mean of its divisors is an integer number (72735652999).
Almost surely, 2145471305997 is an apocalyptic number.
It is an amenable number.
145471305997 is a deficient number, since it is larger than the sum of its proper divisors (1).
145471305997 is an equidigital number, since it uses as much as digits as its factorization.
145471305997 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4762800, while the sum is 55.
The spelling of 145471305997 in words is "one hundred forty-five billion, four hundred seventy-one million, three hundred five thousand, nine hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •