Base | Representation |
---|---|
bin | 11001011100011110… |
… | …10001001000010111 |
3 | 1022021000221020022211 |
4 | 30232033101020113 |
5 | 210434111444101 |
6 | 10135311134251 |
7 | 662344442602 |
oct | 145617211027 |
9 | 38230836284 |
10 | 13660656151 |
11 | 58800a217a |
12 | 2792b14387 |
13 | 13992170bc |
14 | 9383c1339 |
15 | 54e451c51 |
hex | 32e3d1217 |
13660656151 has 8 divisors (see below), whose sum is σ = 14033652624. Its totient is φ = 13287859200.
The previous prime is 13660656131. The next prime is 13660656167. The reversal of 13660656151 is 15165606631.
13660656151 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 13660656151 - 233 = 5070721559 is a prime.
It is a super-2 number, since 2×136606561512 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13660656101) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 94551 + ... + 190423.
It is an arithmetic number, because the mean of its divisors is an integer number (1754206578).
Almost surely, 213660656151 is an apocalyptic number.
13660656151 is a deficient number, since it is larger than the sum of its proper divisors (372996473).
13660656151 is an equidigital number, since it uses as much as digits as its factorization.
13660656151 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 99761.
The product of its (nonzero) digits is 97200, while the sum is 40.
The spelling of 13660656151 in words is "thirteen billion, six hundred sixty million, six hundred fifty-six thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •