Base | Representation |
---|---|
bin | 10001010111110… |
… | …01011001001001 |
3 | 101011012121010021 |
4 | 20223321121021 |
5 | 244301200001 |
6 | 22243220441 |
7 | 3416433142 |
oct | 1053713111 |
9 | 334177107 |
10 | 145725001 |
11 | 75292394 |
12 | 40977721 |
13 | 24263116 |
14 | 154d4ac9 |
15 | cbd7ba1 |
hex | 8af9649 |
145725001 has 4 divisors (see below), whose sum is σ = 145763604. Its totient is φ = 145686400.
The previous prime is 145724939. The next prime is 145725031. The reversal of 145725001 is 100527541.
145725001 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 100527541 = 3187 ⋅31543.
It can be written as a sum of positive squares in 2 ways, for example, as 134676025 + 11048976 = 11605^2 + 3324^2 .
It is a cyclic number.
It is not a de Polignac number, because 145725001 - 215 = 145692233 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (145725031) 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, 12940 + ... + 21421.
It is an arithmetic number, because the mean of its divisors is an integer number (36440901).
Almost surely, 2145725001 is an apocalyptic number.
It is an amenable number.
145725001 is a deficient number, since it is larger than the sum of its proper divisors (38603).
145725001 is an equidigital number, since it uses as much as digits as its factorization.
145725001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 38602.
The product of its (nonzero) digits is 1400, while the sum is 25.
The square root of 145725001 is about 12071.6610704575. The cubic root of 145725001 is about 526.2329311420.
The spelling of 145725001 in words is "one hundred forty-five million, seven hundred twenty-five thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •