Base | Representation |
---|---|
bin | 1000011111001111011… |
… | …0001110110100110101 |
3 | 111221101210110120120222 |
4 | 2013303312032310311 |
5 | 4342122200011012 |
6 | 150554023504125 |
7 | 13351452024542 |
oct | 2076366166465 |
9 | 457353416528 |
10 | 145825000757 |
11 | 56931458457 |
12 | 243185b8045 |
13 | 1099c6180c7 |
14 | 70b50c5bc9 |
15 | 3bd72dc972 |
hex | 21f3d8ed35 |
145825000757 has 4 divisors (see below), whose sum is σ = 154402941996. Its totient is φ = 137247059520.
The previous prime is 145825000751. The next prime is 145825000771. The reversal of 145825000757 is 757000528541.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 72593063761 + 73231936996 = 269431^2 + 270614^2 .
It is a cyclic number.
It is not a de Polignac number, because 145825000757 - 28 = 145825000501 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (145825000751) 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, 4288970594 + ... + 4288970627.
It is an arithmetic number, because the mean of its divisors is an integer number (38600735499).
Almost surely, 2145825000757 is an apocalyptic number.
145825000757 is a gapful number since it is divisible by the number (17) formed by its first and last digit.
It is an amenable number.
145825000757 is a deficient number, since it is larger than the sum of its proper divisors (8577941239).
145825000757 is an equidigital number, since it uses as much as digits as its factorization.
145825000757 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8577941238.
The product of its (nonzero) digits is 392000, while the sum is 44.
The spelling of 145825000757 in words is "one hundred forty-five billion, eight hundred twenty-five million, seven hundred fifty-seven", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •