Base | Representation |
---|---|
bin | 10001011001101… |
… | …00101010111001 |
3 | 101011122221011212 |
4 | 20230310222321 |
5 | 244331432201 |
6 | 22252332505 |
7 | 3421464050 |
oct | 1054645271 |
9 | 334587155 |
10 | 145967801 |
11 | 75438851 |
12 | 40a74135 |
13 | 243197a5 |
14 | 15559397 |
15 | cc34abb |
hex | 8b34ab9 |
145967801 has 4 divisors (see below), whose sum is σ = 166820352. Its totient is φ = 125115252.
The previous prime is 145967791. The next prime is 145967803. The reversal of 145967801 is 108769541.
145967801 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 108769541 = 7057 ⋅15413.
It is a cyclic number.
It is not a de Polignac number, because 145967801 - 26 = 145967737 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (145967803) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 10426265 + ... + 10426278.
It is an arithmetic number, because the mean of its divisors is an integer number (41705088).
Almost surely, 2145967801 is an apocalyptic number.
It is an amenable number.
145967801 is a deficient number, since it is larger than the sum of its proper divisors (20852551).
145967801 is an equidigital number, since it uses as much as digits as its factorization.
145967801 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 20852550.
The product of its (nonzero) digits is 60480, while the sum is 41.
The square root of 145967801 is about 12081.7134960236. The cubic root of 145967801 is about 526.5250303228.
The spelling of 145967801 in words is "one hundred forty-five million, nine hundred sixty-seven thousand, eight hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.188 sec. • engine limits •