Base | Representation |
---|---|
bin | 10001010100100… |
… | …10001100100011 |
3 | 101010102010021221 |
4 | 20222102030203 |
5 | 244144133212 |
6 | 22230155511 |
7 | 3413022613 |
oct | 1052221443 |
9 | 333363257 |
10 | 145302307 |
11 | 75023857 |
12 | 407b2b97 |
13 | 241458c7 |
14 | 15424a43 |
15 | cb52807 |
hex | 8a92323 |
145302307 has 4 divisors (see below), whose sum is σ = 145463416. Its totient is φ = 145141200.
The previous prime is 145302299. The next prime is 145302323. The reversal of 145302307 is 703203541.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 703203541 = 23 ⋅30574067.
It is a cyclic number.
It is not a de Polignac number, because 145302307 - 23 = 145302299 is a prime.
It is a super-2 number, since 2×1453023072 = 42225520839044498, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (145302607) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 79194 + ... + 81007.
It is an arithmetic number, because the mean of its divisors is an integer number (36365854).
Almost surely, 2145302307 is an apocalyptic number.
145302307 is a deficient number, since it is larger than the sum of its proper divisors (161109).
145302307 is an equidigital number, since it uses as much as digits as its factorization.
145302307 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 161108.
The product of its (nonzero) digits is 2520, while the sum is 25.
The square root of 145302307 is about 12054.1406578818. The cubic root of 145302307 is about 525.7236364297.
Adding to 145302307 its reverse (703203541), we get a palindrome (848505848).
The spelling of 145302307 in words is "one hundred forty-five million, three hundred two thousand, three hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •