Base | Representation |
---|---|
bin | 110001101011000011… |
… | …1001110000011010100 |
3 | 101012100010010012022210 |
4 | 1203112013032003110 |
5 | 3221430341310032 |
6 | 121000522553420 |
7 | 10464263132154 |
oct | 1432607160324 |
9 | 335303105283 |
10 | 106671431892 |
11 | 4126a273683 |
12 | 18810068870 |
13 | a09ca2458c |
14 | 523d0cc764 |
15 | 2b94ca02cc |
hex | 18d61ce0d4 |
106671431892 has 24 divisors (see below), whose sum is σ = 256929041152. Its totient is φ = 34410139200.
The previous prime is 106671431833. The next prime is 106671431941. The reversal of 106671431892 is 298134176601.
It is a super-2 number, since 2×1066714318922 (a number of 23 digits) contains 22 as substring.
It is a Smith number, since the sum of its digits (48) coincides with the sum of the digits of its prime factors.
It is a congruent number.
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 7 ways as a sum of consecutive naturals, for example, 143375209 + ... + 143375952.
Almost surely, 2106671431892 is an apocalyptic number.
106671431892 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
106671431892 is an abundant number, since it is smaller than the sum of its proper divisors (150257609260).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
106671431892 is a wasteful number, since it uses less digits than its factorization.
106671431892 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 286751199 (or 286751197 counting only the distinct ones).
The product of its (nonzero) digits is 435456, while the sum is 48.
The spelling of 106671431892 in words is "one hundred six billion, six hundred seventy-one million, four hundred thirty-one thousand, eight hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •