Base | Representation |
---|---|
bin | 100111101001111… |
… | …010110010101101 |
3 | 1201100212202012222 |
4 | 213221322302231 |
5 | 2330304101031 |
6 | 150003405125 |
7 | 22325646362 |
oct | 4751726255 |
9 | 1640782188 |
10 | 665300141 |
11 | 3115a9930 |
12 | 1669837a5 |
13 | a7ab012c |
14 | 64504469 |
15 | 3d61ae7b |
hex | 27a7acad |
665300141 has 4 divisors (see below), whose sum is σ = 725781984. Its totient is φ = 604818300.
The previous prime is 665300131. The next prime is 665300161. The reversal of 665300141 is 141003566.
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.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-665300141 is a prime.
It is a super-2 number, since 2×6653001412 = 885248555229239762, which contains 22 as substring.
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 665300141.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (665300131) 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, 30240905 + ... + 30240926.
It is an arithmetic number, because the mean of its divisors is an integer number (181445496).
Almost surely, 2665300141 is an apocalyptic number.
It is an amenable number.
665300141 is a deficient number, since it is larger than the sum of its proper divisors (60481843).
665300141 is a wasteful number, since it uses less digits than its factorization.
665300141 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 60481842.
The product of its (nonzero) digits is 2160, while the sum is 26.
The square root of 665300141 is about 25793.4127443423. The cubic root of 665300141 is about 872.9831713784.
The spelling of 665300141 in words is "six hundred sixty-five million, three hundred thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •