Base | Representation |
---|---|
bin | 10001010111011… |
… | …10100111010111 |
3 | 101011010100120020 |
4 | 20223232213113 |
5 | 244243241410 |
6 | 22242240223 |
7 | 3416160345 |
oct | 1053564727 |
9 | 334110506 |
10 | 145680855 |
11 | 75262201 |
12 | 40956073 |
13 | 24248cb8 |
14 | 154c2995 |
15 | cbc9a70 |
hex | 8aee9d7 |
145680855 has 8 divisors (see below), whose sum is σ = 233089392. Its totient is φ = 77696448.
The previous prime is 145680851. The next prime is 145680859. The reversal of 145680855 is 558086541.
It is an interprime number because it is at equal distance from previous prime (145680851) and next prime (145680859).
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 145680855 - 22 = 145680851 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (145680851) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4856014 + ... + 4856043.
It is an arithmetic number, because the mean of its divisors is an integer number (29136174).
Almost surely, 2145680855 is an apocalyptic number.
145680855 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
145680855 is a deficient number, since it is larger than the sum of its proper divisors (87408537).
145680855 is an equidigital number, since it uses as much as digits as its factorization.
145680855 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9712065.
The product of its (nonzero) digits is 192000, while the sum is 42.
The square root of 145680855 is about 12069.8324346281. The cubic root of 145680855 is about 526.1797866916.
The spelling of 145680855 in words is "one hundred forty-five million, six hundred eighty thousand, eight hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •