Base | Representation |
---|---|
bin | 10001010110111… |
… | …11111110111111 |
3 | 101011000022100200 |
4 | 20223133332333 |
5 | 244234332202 |
6 | 22241054543 |
7 | 3415520544 |
oct | 1053377677 |
9 | 334008320 |
10 | 145620927 |
11 | 75221181 |
12 | 40927453 |
13 | 2422793a |
14 | 154a8bcb |
15 | cbb6e1c |
hex | 8adffbf |
145620927 has 24 divisors (see below), whose sum is σ = 214451328. Its totient is φ = 95202000.
The previous prime is 145620907. The next prime is 145620947. The reversal of 145620927 is 729026541.
145620927 is a `hidden beast` number, since 1 + 4 + 5 + 620 + 9 + 27 = 666.
It is an interprime number because it is at equal distance from previous prime (145620907) and next prime (145620947).
It is not a de Polignac number, because 145620927 - 27 = 145620799 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 145620891 and 145620900.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (145620907) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 112152 + ... + 113442.
It is an arithmetic number, because the mean of its divisors is an integer number (8935472).
Almost surely, 2145620927 is an apocalyptic number.
145620927 is a deficient number, since it is larger than the sum of its proper divisors (68830401).
145620927 is a wasteful number, since it uses less digits than its factorization.
145620927 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1531 (or 1528 counting only the distinct ones).
The product of its (nonzero) digits is 30240, while the sum is 36.
The square root of 145620927 is about 12067.3496261607. The cubic root of 145620927 is about 526.1076261526.
The spelling of 145620927 in words is "one hundred forty-five million, six hundred twenty thousand, nine hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •