Base | Representation |
---|---|
bin | 10001010011010… |
… | …11101000001101 |
3 | 101010010002121001 |
4 | 20221223220031 |
5 | 244124104313 |
6 | 22222540301 |
7 | 3411464215 |
oct | 1051535015 |
9 | 333102531 |
10 | 145144333 |
11 | 74a260a4 |
12 | 40737691 |
13 | 240bba29 |
14 | 153c3245 |
15 | cb20add |
hex | 8a6ba0d |
145144333 has 4 divisors (see below), whose sum is σ = 150149340. Its totient is φ = 140139328.
The previous prime is 145144331. The next prime is 145144343. The reversal of 145144333 is 333441541.
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 60559524 + 84584809 = 7782^2 + 9197^2 .
It is a cyclic number.
It is not a de Polignac number, because 145144333 - 21 = 145144331 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 (145144331) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2502460 + ... + 2502517.
It is an arithmetic number, because the mean of its divisors is an integer number (37537335).
Almost surely, 2145144333 is an apocalyptic number.
It is an amenable number.
145144333 is a deficient number, since it is larger than the sum of its proper divisors (5005007).
145144333 is an equidigital number, since it uses as much as digits as its factorization.
145144333 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5005006.
The product of its digits is 8640, while the sum is 28.
The square root of 145144333 is about 12047.5861897726. The cubic root of 145144333 is about 525.5330434895.
Adding to 145144333 its reverse (333441541), we get a palindrome (478585874).
The spelling of 145144333 in words is "one hundred forty-five million, one hundred forty-four thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •