Base | Representation |
---|---|
bin | 11000001010010001001010… |
… | …111010111000011100111001 |
3 | 111221020020101211120220002222 |
4 | 120022101022322320130321 |
5 | 102411420403422240401 |
6 | 1013554332254133425 |
7 | 31244640554126561 |
oct | 3012211272703471 |
9 | 457206354526088 |
10 | 106258747852601 |
11 | 3094809a003a23 |
12 | bb017a77b1275 |
13 | 473a2069ccc66 |
14 | 1c34d4514dda1 |
15 | c44079542c1b |
hex | 60a44aeb8739 |
106258747852601 has 8 divisors (see below), whose sum is σ = 107807080929984. Its totient is φ = 104711851747440.
The previous prime is 106258747852597. The next prime is 106258747852709.
106258747852601 is nontrivially palindromic in base 10.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 106258747852601 - 22 = 106258747852597 is a prime.
It is a super-2 number, since 2×1062587478526012 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (106258747872601) 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, 359094086 + ... + 359389871.
It is an arithmetic number, because the mean of its divisors is an integer number (13475885116248).
Almost surely, 2106258747852601 is an apocalyptic number.
It is an amenable number.
106258747852601 is a deficient number, since it is larger than the sum of its proper divisors (1548333077383).
106258747852601 is an equidigital number, since it uses as much as digits as its factorization.
106258747852601 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 718486111.
The product of its (nonzero) digits is 45158400, while the sum is 62.
The spelling of 106258747852601 in words is "one hundred six trillion, two hundred fifty-eight billion, seven hundred forty-seven million, eight hundred fifty-two thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •