Base | Representation |
---|---|
bin | 10001010010101… |
… | …00100010001101 |
3 | 101002221021211122 |
4 | 20221110202031 |
5 | 244113042431 |
6 | 22220530325 |
7 | 3410621354 |
oct | 1051244215 |
9 | 332837748 |
10 | 145049741 |
11 | 74971021 |
12 | 406b09a5 |
13 | 24087965 |
14 | 1539a99b |
15 | cb02a7b |
hex | 8a5488d |
145049741 has 4 divisors (see below), whose sum is σ = 145141500. Its totient is φ = 144957984.
The previous prime is 145049701. The next prime is 145049771. The reversal of 145049741 is 147940541.
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 74321641 + 70728100 = 8621^2 + 8410^2 .
It is a cyclic number.
It is not a de Polignac number, because 145049741 - 218 = 144787597 is a prime.
It is a super-3 number, since 3×1450497413 (a number of 25 digits) contains 333 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (145049701) 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, 43466 + ... + 46683.
It is an arithmetic number, because the mean of its divisors is an integer number (36285375).
Almost surely, 2145049741 is an apocalyptic number.
It is an amenable number.
145049741 is a deficient number, since it is larger than the sum of its proper divisors (91759).
145049741 is an equidigital number, since it uses as much as digits as its factorization.
145049741 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 91758.
The product of its (nonzero) digits is 20160, while the sum is 35.
The square root of 145049741 is about 12043.6597843014. The cubic root of 145049741 is about 525.4188536491.
The spelling of 145049741 in words is "one hundred forty-five million, forty-nine thousand, seven hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •