Base | Representation |
---|---|
bin | 11000010001001100000110… |
… | …101011100001000011011010 |
3 | 111222220200222222021220121002 |
4 | 120101030012223201003122 |
5 | 102442213414123000040 |
6 | 1015001025245345002 |
7 | 31324205360451203 |
oct | 3021140653410332 |
9 | 458820888256532 |
10 | 106734344343770 |
11 | 31010865907000 |
12 | bb799b7b68162 |
13 | 477300c081c80 |
14 | 1c4dd812dc5aa |
15 | c51612a2ba15 |
hex | 611306ae10da |
106734344343770 has 64 divisors (see below), whose sum is σ = 227574919111680. Its totient is φ = 35826912728640.
The previous prime is 106734344343763. The next prime is 106734344343811. The reversal of 106734344343770 is 77343443437601.
It is a super-2 number, since 2×1067343443437702 (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 (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 308254250 + ... + 308600309.
It is an arithmetic number, because the mean of its divisors is an integer number (3555858111120).
Almost surely, 2106734344343770 is an apocalyptic number.
106734344343770 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
106734344343770 is an abundant number, since it is smaller than the sum of its proper divisors (120840574767910).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
106734344343770 is a wasteful number, since it uses less digits than its factorization.
106734344343770 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 616854612 (or 616854590 counting only the distinct ones).
The product of its (nonzero) digits is 42674688, while the sum is 56.
The spelling of 106734344343770 in words is "one hundred six trillion, seven hundred thirty-four billion, three hundred forty-four million, three hundred forty-three thousand, seven hundred seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.118 sec. • engine limits •