Base | Representation |
---|---|
bin | 1000011100100000110… |
… | …1001010101010001001 |
3 | 111212111202201201020101 |
4 | 2013020031022222021 |
5 | 4334122230043442 |
6 | 150353230325401 |
7 | 13324351403620 |
oct | 2071015125211 |
9 | 455452651211 |
10 | 145092815497 |
11 | 56596125873 |
12 | 24153359861 |
13 | 108b3a1a1a6 |
14 | 7045b706b7 |
15 | 3b92dadcb7 |
hex | 21c834aa89 |
145092815497 has 4 divisors (see below), whose sum is σ = 165820360576. Its totient is φ = 124365270420.
The previous prime is 145092815479. The next prime is 145092815503. The reversal of 145092815497 is 794518290541.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-145092815497 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (145092815597) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 10363772529 + ... + 10363772542.
It is an arithmetic number, because the mean of its divisors is an integer number (41455090144).
Almost surely, 2145092815497 is an apocalyptic number.
It is an amenable number.
145092815497 is a deficient number, since it is larger than the sum of its proper divisors (20727545079).
145092815497 is an equidigital number, since it uses as much as digits as its factorization.
145092815497 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20727545078.
The product of its (nonzero) digits is 3628800, while the sum is 55.
The spelling of 145092815497 in words is "one hundred forty-five billion, ninety-two million, eight hundred fifteen thousand, four hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •