Base | Representation |
---|---|
bin | 110001101010010100… |
… | …1011101010111001111 |
3 | 101012021101212110112002 |
4 | 1203110221131113033 |
5 | 3221403043244241 |
6 | 120554244102515 |
7 | 10463544202613 |
oct | 1432451352717 |
9 | 335241773462 |
10 | 106646853071 |
11 | 41257406200 |
12 | 18803994a3b |
13 | a0978c9cb5 |
14 | 5239b31343 |
15 | 2b92a4789b |
hex | 18d4a5d5cf |
106646853071 has 24 divisors (see below), whose sum is σ = 118314435792. Its totient is φ = 96052176000.
The previous prime is 106646853041. The next prime is 106646853101. The reversal of 106646853071 is 170358646601.
It is an interprime number because it is at equal distance from previous prime (106646853041) and next prime (106646853101).
It is not a de Polignac number, because 106646853071 - 226 = 106579744207 is a prime.
It is a super-2 number, since 2×1066468530712 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (106646853041) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 8663621 + ... + 8675921.
It is an arithmetic number, because the mean of its divisors is an integer number (4929768158).
Almost surely, 2106646853071 is an apocalyptic number.
106646853071 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
106646853071 is a deficient number, since it is larger than the sum of its proper divisors (11667582721).
106646853071 is a wasteful number, since it uses less digits than its factorization.
106646853071 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12983 (or 12972 counting only the distinct ones).
The product of its (nonzero) digits is 725760, while the sum is 47.
The spelling of 106646853071 in words is "one hundred six billion, six hundred forty-six million, eight hundred fifty-three thousand, seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •