Base | Representation |
---|---|
bin | 11000010100100010100010… |
… | …000100100101110100001010 |
3 | 112000201201021211001102102222 |
4 | 120110202202010211310022 |
5 | 103010001432132331132 |
6 | 1015254503554254042 |
7 | 31346636060002235 |
oct | 3024424204456412 |
9 | 460651254042388 |
10 | 106964584652042 |
11 | 3109a475525407 |
12 | bbb6552b87322 |
13 | 478b942494480 |
14 | 1c5b18370041c |
15 | c575dac47412 |
hex | 6148a2125d0a |
106964584652042 has 8 divisors (see below), whose sum is σ = 172788944437956. Its totient is φ = 49368269839392.
The previous prime is 106964584652021. The next prime is 106964584652059. The reversal of 106964584652042 is 240256485469601.
106964584652042 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 2 ways, for example, as 88300620779281 + 18663963872761 = 9396841^2 + 4320181^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×1069645846520422 (a number of 29 digits) contains 22 as substring.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2057011243283 + ... + 2057011243334.
Almost surely, 2106964584652042 is an apocalyptic number.
106964584652042 is a deficient number, since it is larger than the sum of its proper divisors (65824359785914).
106964584652042 is a wasteful number, since it uses less digits than its factorization.
106964584652042 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4114022486632.
The product of its (nonzero) digits is 99532800, while the sum is 62.
The spelling of 106964584652042 in words is "one hundred six trillion, nine hundred sixty-four billion, five hundred eighty-four million, six hundred fifty-two thousand, forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •