Base | Representation |
---|---|
bin | 1100011011001101100010… |
… | …1100100101110111000110 |
3 | 1210101001001121000200220101 |
4 | 3012303120230211313012 |
5 | 3242313010140204400 |
6 | 45020022241154314 |
7 | 2610006652220152 |
oct | 306633054456706 |
9 | 53331047020811 |
10 | 13661631569350 |
11 | 4397957954576 |
12 | 164787092b99a |
13 | 7813950acc4b |
14 | 353325710062 |
15 | 18a5850e056a |
hex | c6cd8b25dc6 |
13661631569350 has 12 divisors (see below), whose sum is σ = 25410634719084. Its totient is φ = 5464652627720.
The previous prime is 13661631569263. The next prime is 13661631569393. The reversal of 13661631569350 is 5396513616631.
It is a super-3 number, since 3×136616315693503 (a number of 40 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 13661631569291 and 13661631569300.
It is a congruent number.
It is an unprimeable number.
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 5 ways as a sum of consecutive naturals, for example, 136616315644 + ... + 136616315743.
It is an arithmetic number, because the mean of its divisors is an integer number (2117552893257).
Almost surely, 213661631569350 is an apocalyptic number.
13661631569350 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
13661631569350 is a deficient number, since it is larger than the sum of its proper divisors (11749003149734).
13661631569350 is a wasteful number, since it uses less digits than its factorization.
13661631569350 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 273232631399 (or 273232631394 counting only the distinct ones).
The product of its (nonzero) digits is 7873200, while the sum is 55.
The spelling of 13661631569350 in words is "thirteen trillion, six hundred sixty-one billion, six hundred thirty-one million, five hundred sixty-nine thousand, three hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •