Base | Representation |
---|---|
bin | 11000001101111110010110… |
… | …110100011111010011010001 |
3 | 111222010120202200021200110120 |
4 | 120031332112310133103101 |
5 | 102430103443111044401 |
6 | 1014311331442420453 |
7 | 31302224643264342 |
oct | 3015762664372321 |
9 | 458116680250416 |
10 | 106513424315601 |
11 | 30a360a9255026 |
12 | bb43022361729 |
13 | 475823289b604 |
14 | 1c433c4a840c9 |
15 | c4a9d2ba5836 |
hex | 60df96d1f4d1 |
106513424315601 has 8 divisors (see below), whose sum is σ = 142971039350400. Its totient is φ = 70532379412272.
The previous prime is 106513424315563. The next prime is 106513424315611.
106513424315601 is nontrivially palindromic in base 10.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 106513424315601 - 26 = 106513424315537 is a prime.
It is a super-3 number, since 3×1065134243156013 (a number of 43 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is not an unprimeable number, because it can be changed into a prime (106513424315611) 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, 119142532345 + ... + 119142533238.
It is an arithmetic number, because the mean of its divisors is an integer number (17871379918800).
Almost surely, 2106513424315601 is an apocalyptic number.
It is an amenable number.
106513424315601 is a deficient number, since it is larger than the sum of its proper divisors (36457615034799).
106513424315601 is a wasteful number, since it uses less digits than its factorization.
106513424315601 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 238285065735.
The product of its (nonzero) digits is 259200, while the sum is 42.
The spelling of 106513424315601 in words is "one hundred six trillion, five hundred thirteen billion, four hundred twenty-four million, three hundred fifteen thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •