Base | Representation |
---|---|
bin | 11000010001011111011000… |
… | …111010111011111100110101 |
3 | 111222222200110002101221120002 |
4 | 120101133120322323330311 |
5 | 102443033321134030040 |
6 | 1015014332115121045 |
7 | 31325540460231404 |
oct | 3021373072737465 |
9 | 458880402357502 |
10 | 106755051470645 |
11 | 310196215029a6 |
12 | bb81a168a3185 |
13 | 4774c5c0c2b76 |
14 | 1c50d8749563b |
15 | c51e258c6a15 |
hex | 6117d8ebbf35 |
106755051470645 has 8 divisors (see below), whose sum is σ = 128108279208120. Its totient is φ = 85402562880960.
The previous prime is 106755051470603. The next prime is 106755051470657. The reversal of 106755051470645 is 546074150557601.
It can be written as a sum of positive squares in 4 ways, for example, as 49972089980836 + 56782961489809 = 7069094^2 + 7535447^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-106755051470645 is a prime.
It is a super-2 number, since 2×1067550514706452 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 184469150 + ... + 185046959.
It is an arithmetic number, because the mean of its divisors is an integer number (16013534901015).
Almost surely, 2106755051470645 is an apocalyptic number.
It is an amenable number.
106755051470645 is a deficient number, since it is larger than the sum of its proper divisors (21353227737475).
106755051470645 is an equidigital number, since it uses as much as digits as its factorization.
106755051470645 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 369573895.
The product of its (nonzero) digits is 17640000, while the sum is 56.
The spelling of 106755051470645 in words is "one hundred six trillion, seven hundred fifty-five billion, fifty-one million, four hundred seventy thousand, six hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •