Base | Representation |
---|---|
bin | 1001101100101101000111… |
… | …1101000010001001110000 |
3 | 1101202102200210112120010120 |
4 | 2123023101331002021300 |
5 | 2344203104101011131 |
6 | 34402445442130240 |
7 | 2150264503133502 |
oct | 233132175021160 |
9 | 41672623476116 |
10 | 10663631266416 |
11 | 34414699388a7 |
12 | 1242824650980 |
13 | 5c476494c55b |
14 | 28c1a0233d72 |
15 | 1375bb1ee496 |
hex | 9b2d1f42270 |
10663631266416 has 40 divisors (see below), whose sum is σ = 28997593797120. Its totient is φ = 3367462504896.
The previous prime is 10663631266411. The next prime is 10663631266423. The reversal of 10663631266416 is 61466213636601.
It is a super-2 number, since 2×106636312664162 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10663631266411) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5846288160 + ... + 5846289983.
It is an arithmetic number, because the mean of its divisors is an integer number (724939844928).
Almost surely, 210663631266416 is an apocalyptic number.
10663631266416 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
10663631266416 is an abundant number, since it is smaller than the sum of its proper divisors (18333962530704).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10663631266416 is a wasteful number, since it uses less digits than its factorization.
10663631266416 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11692578173 (or 11692578167 counting only the distinct ones).
The product of its (nonzero) digits is 3359232, while the sum is 51.
The spelling of 10663631266416 in words is "ten trillion, six hundred sixty-three billion, six hundred thirty-one million, two hundred sixty-six thousand, four hundred sixteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •