Base | Representation |
---|---|
bin | 110001101010110010… |
… | …0110110001000100011 |
3 | 101012022111011101202001 |
4 | 1203111210312020203 |
5 | 3221421034433102 |
6 | 121000001504431 |
7 | 10464123422341 |
oct | 1432544661043 |
9 | 335274141661 |
10 | 106662421027 |
11 | 41265179688 |
12 | 18809042117 |
13 | a09abbacc6 |
14 | 523bc24991 |
15 | 2b940c0487 |
hex | 18d5936223 |
106662421027 has 8 divisors (see below), whose sum is σ = 112413004560. Its totient is φ = 100925514720.
The previous prime is 106662421007. The next prime is 106662421031. The reversal of 106662421027 is 720124266601.
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 106662421027 - 235 = 72302682659 is a prime.
It is a super-2 number, since 2×1066624210272 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (106662421007) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 3403288 + ... + 3434485.
It is an arithmetic number, because the mean of its divisors is an integer number (14051625570).
Almost surely, 2106662421027 is an apocalyptic number.
106662421027 is a deficient number, since it is larger than the sum of its proper divisors (5750583533).
106662421027 is an equidigital number, since it uses as much as digits as its factorization.
106662421027 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6838613.
The product of its (nonzero) digits is 48384, while the sum is 37.
Adding to 106662421027 its reverse (720124266601), we get a palindrome (826786687628).
The spelling of 106662421027 in words is "one hundred six billion, six hundred sixty-two million, four hundred twenty-one thousand, twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •