Base | Representation |
---|---|
bin | 11000010100100100101111… |
… | …111100111000010010000001 |
3 | 112000201221102201002101101201 |
4 | 120110210233330320102001 |
5 | 103010021321014321301 |
6 | 1015255540105301201 |
7 | 31350052052406223 |
oct | 3024445774702201 |
9 | 460657381071351 |
10 | 106966964995201 |
11 | 310a0487131463 |
12 | bbb6ab8194801 |
13 | 478bc31689c4c |
14 | 1c5b32b8c4413 |
15 | c576c9bd9201 |
hex | 61492ff38481 |
106966964995201 has 8 divisors (see below), whose sum is σ = 111762849179520. Its totient is φ = 102183176358912.
The previous prime is 106966964995169. The next prime is 106966964995243. The reversal of 106966964995201 is 102599469669601.
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 106966964995201 - 25 = 106966964995169 is a prime.
It is a super-2 number, since 2×1069669649952012 (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 (106966964992201) 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, 3023868925 + ... + 3023904298.
It is an arithmetic number, because the mean of its divisors is an integer number (13970356147440).
Almost surely, 2106966964995201 is an apocalyptic number.
It is an amenable number.
106966964995201 is a deficient number, since it is larger than the sum of its proper divisors (4795884184319).
106966964995201 is an equidigital number, since it uses as much as digits as its factorization.
106966964995201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6047774015.
The product of its (nonzero) digits is 340122240, while the sum is 73.
The spelling of 106966964995201 in words is "one hundred six trillion, nine hundred sixty-six billion, nine hundred sixty-four million, nine hundred ninety-five thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •