Base | Representation |
---|---|
bin | 110101001100100110101… |
… | …011101110000101011101 |
3 | 110221110220122211110102101 |
4 | 311030212223232011131 |
5 | 434343301014222221 |
6 | 11435220112525101 |
7 | 525053546460442 |
oct | 65144653560535 |
9 | 13843818743371 |
10 | 3655666164061 |
11 | 118a3a527923a |
12 | 4b05ab250791 |
13 | 2069600ac112 |
14 | c8d142199c9 |
15 | 6515b5e9d91 |
hex | 35326aee15d |
3655666164061 has 8 divisors (see below), whose sum is σ = 3848391388800. Its totient is φ = 3462973113600.
The previous prime is 3655666164053. The next prime is 3655666164077. The reversal of 3655666164061 is 1604616665563.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 3655666164061 - 23 = 3655666164053 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 3655666163993 and 3655666164011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3655666165061) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 7810165 + ... + 8264986.
It is an arithmetic number, because the mean of its divisors is an integer number (481048923600).
Almost surely, 23655666164061 is an apocalyptic number.
It is an amenable number.
3655666164061 is a deficient number, since it is larger than the sum of its proper divisors (192725224739).
3655666164061 is a wasteful number, since it uses less digits than its factorization.
3655666164061 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16087139.
The product of its (nonzero) digits is 13996800, while the sum is 55.
The spelling of 3655666164061 in words is "three trillion, six hundred fifty-five billion, six hundred sixty-six million, one hundred sixty-four thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •