Base | Representation |
---|---|
bin | 10001010100100… |
… | …11000010001011 |
3 | 101010102022000001 |
4 | 20222103002023 |
5 | 244144240424 |
6 | 22230223431 |
7 | 3413035615 |
oct | 1052230213 |
9 | 333368001 |
10 | 145305739 |
11 | 75026397 |
12 | 407b4b77 |
13 | 24147337 |
14 | 15425db5 |
15 | cb53844 |
hex | 8a9308b |
145305739 has 4 divisors (see below), whose sum is σ = 145330240. Its totient is φ = 145281240.
The previous prime is 145305737. The next prime is 145305779. The reversal of 145305739 is 937503541.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It is a cyclic number.
It is not a de Polignac number, because 145305739 - 21 = 145305737 is a prime.
It is a super-2 number, since 2×1453057392 = 42227515572672242, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 145305698 and 145305707.
It is not an unprimeable number, because it can be changed into a prime (145305737) 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, 2854 + ... + 17284.
It is an arithmetic number, because the mean of its divisors is an integer number (36332560).
Almost surely, 2145305739 is an apocalyptic number.
145305739 is a deficient number, since it is larger than the sum of its proper divisors (24501).
145305739 is a wasteful number, since it uses less digits than its factorization.
145305739 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24500.
The product of its (nonzero) digits is 56700, while the sum is 37.
The square root of 145305739 is about 12054.2830147628. The cubic root of 145305739 is about 525.7277755457.
The spelling of 145305739 in words is "one hundred forty-five million, three hundred five thousand, seven hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •