Base | Representation |
---|---|
bin | 1001101100101100100000… |
… | …0100000010010111101011 |
3 | 1101202102021020022010101010 |
4 | 2123023020010002113223 |
5 | 2344202234111031110 |
6 | 34402421153355003 |
7 | 2150260416531351 |
oct | 233131004022753 |
9 | 41672236263333 |
10 | 10663465330155 |
11 | 34413942014a0 |
12 | 1242798b68a63 |
13 | 5c4739460b11 |
14 | 28c18619b7d1 |
15 | 1375ab873020 |
hex | 9b2c81025eb |
10663465330155 has 64 divisors (see below), whose sum is σ = 18849246704640. Its totient is φ = 5104713408000.
The previous prime is 10663465330153. The next prime is 10663465330241. The reversal of 10663465330155 is 55103356436601.
It is not a de Polignac number, because 10663465330155 - 21 = 10663465330153 is a prime.
It is a super-2 number, since 2×106634653301552 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (10663465330153) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 5091549 + ... + 6873921.
It is an arithmetic number, because the mean of its divisors is an integer number (294519479760).
Almost surely, 210663465330155 is an apocalyptic number.
10663465330155 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
10663465330155 is a deficient number, since it is larger than the sum of its proper divisors (8185781374485).
10663465330155 is a wasteful number, since it uses less digits than its factorization.
10663465330155 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1782852.
The product of its (nonzero) digits is 2916000, while the sum is 48.
The spelling of 10663465330155 in words is "ten trillion, six hundred sixty-three billion, four hundred sixty-five million, three hundred thirty thousand, one hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.142 sec. • engine limits •