Base | Representation |
---|---|
bin | 10001011001000… |
… | …00101011001111 |
3 | 101011111202211121 |
4 | 20230200223033 |
5 | 244321322103 |
6 | 22250501411 |
7 | 3421003222 |
oct | 1054405317 |
9 | 334452747 |
10 | 145885903 |
11 | 75392269 |
12 | 40a34867 |
13 | 242bb427 |
14 | 155375b9 |
15 | cc1a6bd |
hex | 8b20acf |
145885903 has 4 divisors (see below), whose sum is σ = 147732640. Its totient is φ = 144039168.
The previous prime is 145885897. The next prime is 145885919. The reversal of 145885903 is 309588541.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 309588541 = 8647 ⋅35803.
It is a cyclic number.
It is not a de Polignac number, because 145885903 - 25 = 145885871 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 145885903.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (145885973) 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, 923250 + ... + 923407.
It is an arithmetic number, because the mean of its divisors is an integer number (36933160).
Almost surely, 2145885903 is an apocalyptic number.
145885903 is a deficient number, since it is larger than the sum of its proper divisors (1846737).
145885903 is an equidigital number, since it uses as much as digits as its factorization.
145885903 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1846736.
The product of its (nonzero) digits is 172800, while the sum is 43.
The square root of 145885903 is about 12078.3236833594. The cubic root of 145885903 is about 526.4265396195.
The spelling of 145885903 in words is "one hundred forty-five million, eight hundred eighty-five thousand, nine hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •