Base | Representation |
---|---|
bin | 10001010110011… |
… | …10110100010011 |
3 | 101010212201220101 |
4 | 20223032310103 |
5 | 244230104421 |
6 | 22235353231 |
7 | 3415105543 |
oct | 1053166423 |
9 | 333781811 |
10 | 145550611 |
11 | 75183368 |
12 | 408b2817 |
13 | 2420192b |
14 | 1548b323 |
15 | cba1191 |
hex | 8aced13 |
145550611 has 4 divisors (see below), whose sum is σ = 150245824. Its totient is φ = 140855400.
The previous prime is 145550597. The next prime is 145550707. The reversal of 145550611 is 116055541.
It is a happy number.
145550611 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 an emirpimes, since its reverse is a distinct semiprime: 116055541 = 7 ⋅16579363.
It is a cyclic number.
It is not a de Polignac number, because 145550611 - 211 = 145548563 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 145550611.
It is not an unprimeable number, because it can be changed into a prime (145520611) 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, 2347560 + ... + 2347621.
It is an arithmetic number, because the mean of its divisors is an integer number (37561456).
Almost surely, 2145550611 is an apocalyptic number.
145550611 is a deficient number, since it is larger than the sum of its proper divisors (4695213).
145550611 is an equidigital number, since it uses as much as digits as its factorization.
145550611 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4695212.
The product of its (nonzero) digits is 3000, while the sum is 28.
The square root of 145550611 is about 12064.4357928583. The cubic root of 145550611 is about 526.0229319615.
The spelling of 145550611 in words is "one hundred forty-five million, five hundred fifty thousand, six hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.061 sec. • engine limits •