Base | Representation |
---|---|
bin | 1001101001000011111111… |
… | …1000011110010110010001 |
3 | 1101112110011110211110102021 |
4 | 2122100333320132112101 |
5 | 2342141423032234010 |
6 | 34314020003051441 |
7 | 2142620633125141 |
oct | 232207770362621 |
9 | 41473143743367 |
10 | 10601051055505 |
11 | 3417975a52129 |
12 | 123267a670b81 |
13 | 5bb8a078a861 |
14 | 289144c10921 |
15 | 135b571c98da |
hex | 9a43fe1e591 |
10601051055505 has 8 divisors (see below), whose sum is σ = 12721285390824. Its totient is φ = 8480824761600.
The previous prime is 10601051055499. The next prime is 10601051055521. The reversal of 10601051055505 is 50555015010601.
It can be written as a sum of positive squares in 4 ways, for example, as 100158957441 + 10500892098064 = 316479^2 + 3240508^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-10601051055505 is a prime.
It is a super-2 number, since 2×106010510555052 (a number of 27 digits) contains 22 as substring.
It is a Duffinian 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 7 ways as a sum of consecutive naturals, for example, 1422975 + ... + 4819435.
It is an arithmetic number, because the mean of its divisors is an integer number (1590160673853).
Almost surely, 210601051055505 is an apocalyptic number.
It is an amenable number.
10601051055505 is a deficient number, since it is larger than the sum of its proper divisors (2120234335319).
10601051055505 is an equidigital number, since it uses as much as digits as its factorization.
10601051055505 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4020707.
The product of its (nonzero) digits is 18750, while the sum is 34.
The spelling of 10601051055505 in words is "ten trillion, six hundred one billion, fifty-one million, fifty-five thousand, five hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •